On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization

DOI10.1080/00207160.2013.875538zbMath1309.05112OpenAlexW1977852924MaRDI QIDQ2931937

Yuan-Kang Shih, Shin-Shin Kao, Hsun Su

Publication date: 28 November 2014

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2013.875538

zbMATH Keywords

Hamiltonian1-fault HamiltonianOre theorem

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Improved degree conditions for Hamiltonian properties
• On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
• A new sufficient condition for hamiltonicity of graphs
• Hamiltonian-connected graphs
• Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
• Linearly many faults in dual-cube-like networks
• On spanning connected graphs
• Cubic planar Hamiltonian graphs of various types
• Fault-free mutually independent Hamiltonian cycles of faulty star graphs
• Note on Hamilton Circuits
• Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks

This page was built for publication: On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization