An improved degree based condition for Hamiltonian cycles

DOI10.1016/J.IPL.2006.11.013zbMATH Open1185.05096OpenAlexW2011032737MaRDI QIDQ845978FDOQ845978

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

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

zbMATH Keywords

graphsHamiltonian cycleHamiltonian pathcombinatorial problems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

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

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)