2-factors and Hamiltonicity

DOI10.1016/S0012-365X(98)00104-6zbMath0958.05115MaRDI QIDQ1584422

Zdeněk Ryjáček, Ingo Schiermeyer

Publication date: 2 November 2000

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

zbMATH Keywords

2-factorHamilton cycle

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Degree sums, \(k\)-factors and Hamilton cycles in graphs
• Tough graphs and Hamiltonian circuits.
• Note on Hamilton Circuits
• Toughness and the existence ofk-factors
• An algorithmic proof of Tutte's f-factor theorem
• Some Theorems on Abstract Graphs