On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles

DOI10.1016/j.endm.2017.06.044zbMath1378.05113OpenAlexW2743238865MaRDI QIDQ1689917

Shuya Chiba

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.044

zbMATH Keywords

vertex-disjoint cyclesHamilton cycles2-factorsdegree sum conditions

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items

Degree conditions for the existence of vertex-disjoint cycles and paths: a survey

Cites Work

• Unnamed Item
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• On degree sum conditions for long cycles and cycles through specified vertices
• A remark on two sufficient conditions for Hamilton cycles
• On the maximum number of independent cycles in a graph
• On the existence of disjoint cycles in a graph
• Advances on the Hamiltonian problem -- a survey
• On degree sum conditions for 2-factors with a prescribed number of cycles
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• Chvátal Erdős condition and 2-factors with a specyfied number of components
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• Degree conditions for 2-factors
• The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal--Erdös Condition