On the Structure of Non-Hamiltonian Graphs I

DOI10.1017/S0963548300000055zbMath0794.05069MaRDI QIDQ4291183

Roland Haeggkvist

Publication date: 28 August 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

neighboursindependent setvertex-disjoint pathsnon-Hamiltonian graphsneighbourhood-unions

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion ⋮ On one extension of Dirac's theorem on Hamiltonicity ⋮ Toughness in graphs -- a survey

Cites Work

• Hamilton cycles in regular 2-connected graphs
• Planar cubic hypohamiltonian and hypotraceable graphs
• The binding number of a graph and its Anderson number
• Some Theorems on Abstract Graphs

This page was built for publication: On the Structure of Non-Hamiltonian Graphs I