\(k\)-factors and Hamilton cycles in graphs

DOI10.1007/s10114-005-0905-xzbMath1118.05081OpenAlexW2095336287MaRDI QIDQ884893

Zhen Jiang Zhao, Zhi Guo Wang

Publication date: 7 June 2007

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-005-0905-x

zbMATH Keywords

Hamilton cycle2-connected graph\(k\)-factor

Mathematics Subject Classification ID

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

Related Items

The stability number and connected \([k,k+1\)-factor in graphs]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Long cycles in graphs with large degree sums
• Degree sums, \(k\)-factors and Hamilton cycles in graphs
• Tough graphs and Hamiltonian circuits.
• Note on Hamilton Circuits
• On Maximal Circuits in Finite Graphs
• The binding number of a graph and its Anderson number