On the Structure of Non-Hamiltonian Graphs I

DOI10.1017/S0963548300000055MaRDI QIDQ4291183zbMATH OpenFDO

Authors Roland Häggkvist

Publication date 28 August 1994

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

Full work available at URL https://doi.org/10.1017/S0963548300000055

zbMATH Keywords

independent setneighbourhood-unionsneighboursnon-Hamiltonian graphsvertex-disjoint paths

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 904973
• scientific article; zbMATH DE number 3954964
• k -Factors and Neighbourhoods of Independent Sets in Graphs
• Publication:4940054

Cites work

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

Cited in

(12)

• Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion
• On one extension of Dirac's theorem on Hamiltonicity
• A stability version for a theorem of Erdős on nonhamiltonian graphs
• Toughness in graphs -- a survey
• scientific article; zbMATH DE number 3954963 (Why is no real title available?)
• scientific article; zbMATH DE number 3954964 (Why is no real title available?)
• scientific article; zbMATH DE number 125496 (Why is no real title available?)
• Extensions of a theorem of Erdős on nonhamiltonian graphs
• scientific article; zbMATH DE number 904973 (Why is no real title available?)
• Combinatorial Geometry and Graph Theory
• A large set of non-Hamiltonian graphs
• Large Isaacs' graphs are maximally non-Hamilton-connected

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

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