Shin-Shin Kao
According to our database1,
Shin-Shin Kao
authored at least 25 papers
between 2003 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2022
J. Inf. Sci. Eng., 2022
2018
On mutually independent hamiltonian cycles.
Ars Comb., 2018
2017
A study on degree characterization for hamiltonian-connected graphs.
Ars Comb., 2017
2016
On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance.
Discret. Math. Theor. Comput. Sci., 2016
2014
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization.
Int. J. Comput. Math., 2014
2013
Cubic 1-fault-tolerant hamiltonian graphs, Globally 3*-connected graphs, and Super 3-spanning connected graphs.
Ars Comb., 2013
2012
J. Supercomput., 2012
Inf. Process. Lett., 2012
Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs.
Ars Comb., 2012
2011
Comput. Electr. Eng., 2011
2010
Int. J. Comput. Math., 2010
Hamiltonian connectivity and globally 3*-connectivity of dual-cube extensive networks.
Comput. Electr. Eng., 2010
2009
2008
Hamiltonian Connectivity, Pancyclicity and 3^*-Connectivity of Matching Composition Networks.
J. Inf. Sci. Eng., 2008
2007
Extending Security/Sustainability through Pervasive Spider Web Networks in Urbanism.
Proceedings of the 2007 International Conference on Security & Management, 2007
2006
Panpositionable Hamiltonian Graphs.
Ars Comb., 2006
Developing Dual-Surveillance Based Vehicle Security Management with Generalized Honeycomb Tori.
Proceedings of the 2006 International Conference on Security & Management, 2006
2005
Appl. Math. Comput., 2005
Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs.
Appl. Math. Comput., 2005
2003
Brother trees: A family of optimal 1<sub>p</sub>-hamiltonian and 1-edge hamiltonian graphs.
Inf. Process. Lett., 2003
Appl. Math. Comput., 2003