A \([k,k+1]\)-factor containing a given Hamiltonian cycle

DOI10.1007/BF02880002zbMath0917.05062MaRDI QIDQ5967034

No author found.

Publication date: 21 July 1999

Published in: Science in China. Series A (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cycleconnected factor

Mathematics Subject Classification ID

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

Cites Work

• An Ore-type condition for the existence of \(k\)-factors in graphs
• Connected \([k,k+1\)-factors of graphs]
• A degree condition for the existence ofk-factors
• Subgraphs with prescribed valencies
• Unnamed Item

Related Items (5)

Graph factors and factorization: 1985--2003: a survey ⋮ Binding numbers and connected factors ⋮ Stability Number and k-Hamiltonian [a, b-factors] ⋮ On 2-edge-connected \([\mathbf{a,b}\)-factors of graphs with Ore-type condition] ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors]

This page was built for publication: A \([k,k+1]\)-factor containing a given Hamiltonian cycle