A new sufficient condition for hamiltonicity of graphs
From MaRDI portal
Publication:844185
DOI10.1016/J.IPL.2006.01.003zbMath1178.05056OpenAlexW2065858897MaRDI QIDQ844185
Publication date: 18 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.01.003
Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)
Related Items (10)
Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges ⋮ On one extension of Dirac's theorem on Hamiltonicity ⋮ Two types of path structures of graphs ⋮ An improved degree based condition for Hamiltonian cycles ⋮ On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem ⋮ Degree with neighborhood conditions and highly Hamiltonian graphs ⋮ A sufficient condition for pancyclic graphs ⋮ Normal Eulerian clique-covering and hamiltonicity ⋮ A comprehensive analysis of degree based condition for Hamiltonian cycles
Cites Work
This page was built for publication: A new sufficient condition for hamiltonicity of graphs
