On some intriguing problems in Hamiltonian graph theory---a survey

DOI10.1016/S0012-365X(01)00325-9zbMath0998.05040MaRDI QIDQ1613468

Hajo J. Broersma

Publication date: 29 August 2002

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

zbMATH Keywords

claw-free graphHamiltonian graphcubic graphline graphregular graphtoughnessclosuretraceable graphdegree conditionsdominating cyclecyclically 4-edge-connectedspanning Eulerian subgraphhopping lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (18)

A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs ⋮ The Hamiltonian properties in \(K_{1,r}\)-free split graphs ⋮ Forbidden subgraphs for Hamiltonicity of 1-tough graphs ⋮ A degree condition for cycles passing through specified vertices and edges ⋮ Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy ⋮ 2-Trees: Structural insights and the study of Hamiltonian paths ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Hamiltonicity in Split Graphs - A Dichotomy ⋮ Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs ⋮ On \(s\)-Hamiltonicity of net-free line graphs ⋮ How many conjectures can you stand? A survey ⋮ Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs ⋮ Forbidden pairs and the existence of a dominating cycle ⋮ On hamiltonicity of \(P_{3}\)-dominated graphs ⋮ Implementation of RTO in a large hydrogen network considering uncertainty ⋮ Perfect matching dominating cycle — a new dominating cycle ⋮ Circumference of essentially 4-connected planar triangulations ⋮ A condition on Hamilton-connected line graphs

This page was built for publication: On some intriguing problems in Hamiltonian graph theory---a survey