Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
From MaRDI portal
Publication:1827685
DOI10.1016/j.disc.2003.10.015zbMath1041.05044OpenAlexW2098946260MaRDI QIDQ1827685
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.10.015
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items (5)
Graph factors and factorization: 1985--2003: a survey ⋮ Neighborhood-union condition for an \([a, b\)-factor avoiding a specified Hamiltonian cycle] ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors] ⋮ An existence theorem on Hamiltonian (g,f)-factors in networks
Cites Work
This page was built for publication: Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
