A remark on two sufficient conditions for Hamilton cycles

DOI10.1016/0012-365X(78)90124-3zbMath0381.05040OpenAlexW2068734658MaRDI QIDQ1247337

J. A. Bondy

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0012-365x(78)90124-3

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (15)

A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity ⋮ Semi-independence number of a graph and the existence of Hamiltonian circuits ⋮ Circumferences of k-connected graphs involving independence numbers ⋮ A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs ⋮ Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ On degree sum conditions for 2-factors with a prescribed number of cycles ⋮ Degree conditions for Hamiltonicity: counting the number of missing edges ⋮ On Saito's conjecture and the Oberly-Sumner conjectures ⋮ Extensions and consequences of Chvátal-Erdös' theorem ⋮ On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Conditions for graphs to be path partition optimal ⋮ Circuits through specified edges ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ A degree sum condition concerning the connectivity and the independence number of a graph

Cites Work

• Unnamed Item
• Hamiltonian cycles in regular graphs of moderate degree
• A note on Hamiltonian circuits
• Note on Hamilton Circuits

This page was built for publication: A remark on two sufficient conditions for Hamilton cycles