Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs

DOI10.1016/J.DISC.2013.12.005zbMath1281.05089OpenAlexW1995148562MaRDI QIDQ394360

Michael Ferrara, Timothy Morris, Louis DeBiasio

Publication date: 27 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.12.005

zbMATH Keywords

2-factorHamiltonian cycle

Mathematics Subject Classification ID

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

Related Items (5)

Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Degree sum conditions for vertex-disjoint cycles passing through specified vertices ⋮ On 2-factors with a specified number of components in line graphs ⋮ Disjoint cycles and \(2\)-factors with Fan-type condition in a graph ⋮ 2-factors with \(k\) cycles in Hamiltonian graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factors and factorizations of graphs. Proof techniques in factor theory
• Pancyclism in hamiltonian graphs
• Graph factors and factorization: 1985--2003: a survey
• On 2-factors with \(k\) components
• A look at cycles containing specified elements of a graph
• Advances on the Hamiltonian problem -- a survey
• Pancyclic graphs. I
• A note on 2-factors with two components
• Degree conditions for 2-factors
• Some Theorems on Abstract Graphs

This page was built for publication: Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs