A sufficient condition for Hamiltonian circuits

DOI10.1016/0095-8956(78)90037-0zbMath0322.05126OpenAlexW2046955122MaRDI QIDQ1223311

Douglas R. Woodall

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(78)90037-0

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (8)

Binding Number, Minimum Degree, and Cycle Structure in Graphs ⋮ Best monotone degree conditions for binding number ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Best monotone degree conditions for binding number and cycle structure ⋮ Compatible Hamilton cycles in Dirac graphs ⋮ Some recent results in hamiltonian graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Triangles and neighbourhoods of independent sets in graphs

Cites Work

• Unnamed Item
• A method in graph theory
• Sufficient conditions for matchings
• The binding number of a graph and its Anderson number

This page was built for publication: A sufficient condition for Hamiltonian circuits