An efficient condition for a graph to be Hamiltonian

DOI10.1016/j.dam.2007.03.013zbMath1123.05060OpenAlexW2021488373MaRDI QIDQ2383542

Rui Juan Li, Jinfeng Feng, Sheng-Jia Li

Publication date: 19 September 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.03.013

zbMATH Keywords

distanceHamiltonian cyclesufficient condition

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (12)

On one extension of Dirac's theorem on Hamiltonicity ⋮ Hamiltonian paths, unit-interval complexes, and determinantal facet ideals ⋮ Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs ⋮ A sufficient condition for vertex bipancyclicity in balanced bipartite graphs ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem ⋮ Disjoint cycles in hypercubes with prescribed vertices in each cycle ⋮ Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs ⋮ Fan type condition and characterization of Hamiltonian graphs ⋮ Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian ⋮ A sufficient condition for pancyclic graphs ⋮ The H-force sets of the graphs satisfying the condition of Ore's theorem ⋮ A comprehensive analysis of degree based condition for Hamiltonian cycles

Cites Work

• Unnamed Item
• New sufficient conditions for cycles in graphs
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• Advances on the Hamiltonian problem -- a survey
• Note on Hamilton Circuits
• Updating the hamiltonian problem—A survey

This page was built for publication: An efficient condition for a graph to be Hamiltonian