Degree condition for the existence of a \(k\)-factor containing a given Hamiltonian cycle

DOI10.1016/J.DISC.2008.05.014zbMath1214.05119OpenAlexW1986647573MaRDI QIDQ1025493

Guo Jun Li, Yun Shu Gao, Xue-Chao Li

Publication date: 19 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.05.014

zbMATH Keywords

Hamiltonian cyclefactordegree condition

Mathematics Subject Classification ID

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

Related Items (3)

A sufficient condition for the existence of a k-factor excluding a given r-factor ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Induced claws and existence of even factors of graphs

Cites Work

• Unnamed Item
• New sufficient conditions for cycles in graphs
• An Ore-type condition for the existence of \(k\)-factors in graphs
• Note on Hamilton Circuits
• A degree condition for the existence ofk-factors
• Combinatorial Geometry and Graph Theory
• The Factorization of Linear Graphs
• The Factors of Graphs

This page was built for publication: Degree condition for the existence of a \(k\)-factor containing a given Hamiltonian cycle