Long cycles in graphs containing a 2-factor with many odd components

DOI10.1016/0012-365X(93)E0118-NzbMath0822.05041WikidataQ127773978 ScholiaQ127773978MaRDI QIDQ1343811

Jan van den Heuvel

Publication date: 5 October 1995

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

zbMATH Keywords

2-factorodd componentslong cycles2-connected graphhamiltonianindependent verticesconjecture of Häggkvist

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Long cycles in graphs with large degree sums
• Degree sums, \(k\)-factors and Hamilton cycles in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Long cycles in graphs containing a 2-factor with many odd components