A comprehensive analysis of degree based condition for Hamiltonian cycles

DOI10.1016/J.TCS.2009.09.018zbMath1187.05044OpenAlexW2008066793MaRDI QIDQ1041248

Md. Kamrul Hasan, Sungyoung Lee, Young-Koo Lee, Mohammad Kaykobad

Publication date: 1 December 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.018

zbMATH Keywords

graphsHamiltonian cycleHamiltonian path

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Two types of path structures of graphs ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem

Cites Work

• A new sufficient condition for hamiltonicity of graphs
• An improved degree based condition for Hamiltonian cycles
• On Hamiltonian cycles and Hamiltonian paths
• An efficient condition for a graph to be Hamiltonian
• Note on Hamilton Circuits

This page was built for publication: A comprehensive analysis of degree based condition for Hamiltonian cycles