An improved degree based condition for Hamiltonian cycles

DOI10.1016/J.IPL.2006.11.013MaRDI QIDQ845978zbMATH OpenOpenAlexFDO

Authors Lenin Mehedy, Mohammad Kaykobad, Mohammad 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

graphsHamiltonian cycleHamiltonian pathcombinatorial problems

Mathematics Subject Classification ID

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

Recommendations

• An implicit degree condition for Hamiltonian cycles
• A comprehensive analysis of degree based condition for Hamiltonian cycles
• A semiexact degree condition for Hamilton cycles in digraphs
• Improved degree conditions for 2-factors with k cycles in Hamiltonian graphs
• An algorithm for Hamiltonian cycles under implicit degree conditions.
• Implicit degree sum condition for Hamiltonian cycles.
• An implicit degree condition for Hamiltonian graphs
• scientific article; zbMATH DE number 4006296
• A degree condition for Hamiltonian digraphs

Cites work

• scientific article; zbMATH DE number 3730183 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1289749 (Why is no real title available?)
• scientific article; zbMATH DE number 2230266 (Why is no real title available?)
• A lower bound on the number of hamiltonian cycles
• A new sufficient condition for hamiltonicity of graphs
• Advances on the Hamiltonian problem -- a survey
• More than one tough chordal planar graphs are Hamiltonian
• Note on Hamilton Circuits
• On Hamiltonian cycles and Hamiltonian paths
• One criterion of existence of a Hamiltonian cycle
• Onk-ordered Hamiltonian graphs
• Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles
• Spanning 2‐trails from degree sum conditions

Cited in

(8)

• Improved degree conditions for Hamiltonian properties
• On one extension of Dirac's theorem on Hamiltonicity
• Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
• On Hamiltonian cycles and Hamiltonian paths
• A comprehensive analysis of degree based condition for Hamiltonian cycles
• scientific article; zbMATH DE number 773235 (Why is no real title available?)
• On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
• Implicit degree condition restricted to essential independent sets for Hamiltonian cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845978)