Degree conditions for Hamiltonian graphs to have [a,b]-factors containing a given Hamiltonian cycle

DOI10.1016/J.DISC.2003.10.015MaRDI QIDQ1827685zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Hamiltonian graphDegree conditionConnected factor

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1117461 (Why is no real title available?)
• scientific article; zbMATH DE number 1833096 (Why is no real title available?)
• New sufficient conditions for cycles in graphs
• Subgraphs with prescribed valencies

Cited in

(11)

• scientific article; zbMATH DE number 5953644 (Why is no real title available?)
• Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
• A \([k,k+1]\)-factor containing a given 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)