Hamiltonian ?-factors in graphs

DOI<217::AID-JGT5>3.0.CO;2-O 10.1002/(SICI)1097-0118(199707)25:3<217::AID-JGT5>3.0.CO;2-OzbMath0876.05079OpenAlexW2205954910MaRDI QIDQ4344208

Bing Wei, Yung-ching Chu

Publication date: 3 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199707)25:3<217::aid-jgt5>3.0.co;2-o

zbMATH Keywords

Hamilton cycle\(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 (4)

Binding numbers and connected factors ⋮ Stability Number and k-Hamiltonian [a, b-factors] ⋮ Connected (g, f)-factors ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors]

This page was built for publication: Hamiltonian ?-factors in graphs