An improved degree based condition for Hamiltonian cycles

DOI10.1016/j.ipl.2006.11.013zbMath1185.05096OpenAlexW2011032737MaRDI QIDQ845978

Lenin Mehedy, Mohammad Kaykobad, Md. Kamrul Hasan

Publication date: 29 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.11.013

zbMATH Keywords

combinatorial problemsgraphsHamiltonian cycleHamiltonian path

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

On one extension of Dirac's theorem on Hamiltonicity ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem ⋮ A comprehensive analysis of degree based condition for Hamiltonian cycles

Cites Work

• A new sufficient condition for hamiltonicity of graphs
• On Hamiltonian cycles and Hamiltonian paths
• One criterion of existence of a Hamiltonian cycle
• Advances on the Hamiltonian problem -- a survey
• A lower bound on the number of hamiltonian cycles
• Note on Hamilton Circuits
• Onk-ordered Hamiltonian graphs
• Spanning 2‐trails from degree sum conditions
• More than one tough chordal planar graphs are Hamiltonian
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved degree based condition for Hamiltonian cycles