Degree conditions for Hamiltonian graphs to have [a,b]-factors containing a given Hamiltonian cycle
DOI10.1016/J.DISC.2003.10.015zbMATH Open1041.05044OpenAlexW2098946260MaRDI QIDQ1827685FDOQ1827685
Authors: Haruhide Matsuda 
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
Recommendations
- Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
- scientific article; zbMATH DE number 5953644
- A \([k,k+1]\)-factor containing a given Hamiltonian cycle
- Degree condition for the existence of a \(k\)-factor containing a given Hamiltonian cycle
- A \([k,k+1]\)-factor containing a given Hamiltonian cycle
Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (11)
- Title not available (Why is that?)
- A \([k,k+1]\)-factor containing a given Hamiltonian cycle
- Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
- A sufficient condition for graphs to have ID-Hamiltonian \([a,b]\)-factors
- Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
- An existence theorem on Hamiltonian \((g,f)\)-factors in networks
- Degree conditions for graphs to have \([a, b\)]-factors containing a given 2-factor
- Combinatorial Geometry and Graph Theory
- A \([k,k+1]\)-factor containing a given Hamiltonian cycle
- Graph factors and factorization: 1985--2003: a survey
- Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
This page was built for publication: Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827685)
