Остановите войну!
for scientists:
default search action
Shin-Shin Kao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j23]Hsiu-Chunj Pan, Hsun Su, Shin-Shin Kao:
On the 2-Vertex-Fault Hamiltonicity for Graphs Satisfying Ore's Theorem. J. Inf. Sci. Eng. 38(4): 833-857 (2022)
2010 – 2019
- 2018
- [j22]Hsun Su, Hsiu-Chunj Pan, Shih-Yan Chen, Shin-Shin Kao:
On mutually independent hamiltonian cycles. Ars Comb. 139: 185-195 (2018) - 2017
- [j21]Hsun Su, Yuan-Kang Shih, Shih-Yan Chen, Shin-Shin Kao:
A study on degree characterization for hamiltonian-connected graphs. Ars Comb. 133: 297-316 (2017) - 2016
- [j20]Shih-Yan Chen, Shin-Shin Kao, Hsun Su:
On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance. Discret. Math. Theor. Comput. Sci. 17(3): 307-314 (2016) - 2014
- [j19]Yuan-Kang Shih, Hsun Su, Shin-Shin Kao:
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization. Int. J. Comput. Math. 91(9): 1931-1939 (2014) - 2013
- [j18]Shin-Shin Kao, Hua-Min Huang, Kung-Ming Hsu, Lih-Hsing Hsu:
Cubic 1-fault-tolerant hamiltonian graphs, Globally 3*-connected graphs, and Super 3-spanning connected graphs. Ars Comb. 110: 301-322 (2013) - 2012
- [j17]Shin-Shin Kao, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs. Ars Comb. 105: 231-246 (2012) - [j16]Hsun Su, Yuan-Kang Shih, Shin-Shin Kao:
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem. Inf. Process. Lett. 112(21): 839-843 (2012) - [j15]Hsun Su, Shih-Yan Chen, Shin-Shin Kao:
Mutually independent Hamiltonian cycles in alternating group graphs. J. Supercomput. 61(3): 560-571 (2012) - 2011
- [j14]Hsun Su, Jing-Ling Pan, Shin-Shin Kao:
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even. Comput. Electr. Eng. 37(3): 319-331 (2011) - [j13]Yuan-Kang Shih, Shin-Shin Kao:
One-to-one disjoint path covers on k-ary n-cubes. Theor. Comput. Sci. 412(35): 4513-4530 (2011) - 2010
- [j12]Shih-Yan Chen, Shin-Shin Kao:
Hamiltonian connectivity and globally 3*-connectivity of dual-cube extensive networks. Comput. Electr. Eng. 36(3): 404-413 (2010) - [j11]Li-Yen Hsu, Feng-I Ling, Shin-Shin Kao, Hsun-Jung Cho:
Ring embedding in faulty generalized honeycomb torus - GHT(m, n, n/2). Int. J. Comput. Math. 87(15): 3344-3358 (2010) - [j10]Yuan-Kang Shih, Hui-Chun Chuang, Shin-Shin Kao, Jimmy J. M. Tan:
Mutually independent Hamiltonian cycles in dual-cubes. J. Supercomput. 54(2): 239-251 (2010)
2000 – 2009
- 2009
- [j9]Shin-Shin Kao, Hong-Chun Hsu, Lih-Hsing Hsu:
Globally bi-3*-connected graphs. Discret. Math. 309(8): 1931-1946 (2009) - 2008
- [j8]Yuan-Kang Shih, Yi-Chien Wu, Shin-Shin Kao, Jimmy J. M. Tan:
Vertex-bipancyclicity of the generalized honeycomb tori. Comput. Math. Appl. 56(11): 2848-2860 (2008) - [j7]Shin-Shin Kao, Jui-Chia Wu, Yuan-Kang Shih:
Hamiltonian Connectivity, Pancyclicity and 3^*-Connectivity of Matching Composition Networks. J. Inf. Sci. Eng. 24(2): 615-625 (2008) - 2007
- [c2]Li-Yen Hsu, Shin-Shin Kao:
Extending Security/Sustainability through Pervasive Spider Web Networks in Urbanism. Security and Management 2007: 230-235 - 2006
- [j6]Shin-Shin Kao, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
Panpositionable Hamiltonian Graphs. Ars Comb. 81 (2006) - [j5]Shin-Shin Kao, Kung-Ming Hsu, Lih-Hsing Hsu:
Cubic planar hamiltonian graphs of various types. Discret. Math. 306(13): 1364-1389 (2006) - [c1]Li-Yen Hsu, Shin-Shin Kao:
Developing Dual-Surveillance Based Vehicle Security Management with Generalized Honeycomb Tori. Security and Management 2006: 314-320 - 2005
- [j4]Shin-Shin Kao, Lih-Hsing Hsu:
Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs. Appl. Math. Comput. 160(1): 269-282 (2005) - [j3]Shin-Shin Kao, Lih-Hsing Hsu:
The globally bi-3* and hyper bi-3* connectedness of the spider web networks. Appl. Math. Comput. 170(1): 597-610 (2005) - 2003
- [j2]Y-Chuang Chen, Jimmy J. M. Tan, Lih-Hsing Hsu, Shin-Shin Kao:
Super-connectivity and super-edge-connectivity for some interconnection networks. Appl. Math. Comput. 140(2-3): 245-254 (2003) - [j1]Shin-Shin Kao, Lih-Hsing Hsu:
Brother trees: A family of optimal 1p-hamiltonian and 1-edge hamiltonian graphs. Inf. Process. Lett. 86(5): 263-269 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint