A remark on two sufficient conditions for Hamilton cycles

DOI10.1016/0012-365X(78)90124-3zbMATH Open0381.05040OpenAlexW2068734658MaRDI QIDQ1247337FDOQ1247337

Authors: 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

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

Cites Work

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

Cited In (15)

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

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

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