On 2-factors with \(k\) components

DOI10.1016/j.disc.2007.04.049zbMath1214.05131OpenAlexW2104799904MaRDI QIDQ952657

Gábor N. Sárközy

Publication date: 12 November 2008

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

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

zbMATH Keywords

2-factorHamiltonian cycleminimum degreeregularity Lemma

Mathematics Subject Classification ID

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

Related Items (6)

Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp ⋮ Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Partitioning 2-edge-colored graphs by monochromatic paths and cycles ⋮ 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
• Unnamed Item
• Pancyclism in hamiltonian graphs
• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• Advances on the Hamiltonian problem -- a survey
• On the number of Hamiltonian cycles in Dirac graphs
• Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
• A note on 2-factors with two components
• An algorithmic version of the blow-up lemma
• Degree conditions for 2-factors
• Hypergraph Packing and Graph Embedding
• Proof of a Packing Conjecture of Bollobás
• On the square of a Hamiltonian cycle in dense graphs
• Some Theorems on Abstract Graphs
• Proof of the Alon-Yuster conjecture

This page was built for publication: On 2-factors with \(k\) components