On 2-factors with \(k\) components
type: Item
instance of: scholarly article
title: On 2-factors with \(k\) components
zbMATH Open document ID: 1214.05131
author: Gábor N. Sárközy
published in: Discrete Mathematics
publication date: 2008-11-12T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5365257
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: 2-factor
zbMATH Keywords: minimum degree
zbMATH Keywords: regularity Lemma
MaRDI profile type: Publication
full work available at URL: j.disc.2007.04.049
OpenAlex ID: W2104799904
cites work: Pancyclism in hamiltonian graphs
cites work: Q3941433
cites work: Q3852212
cites work: Degree conditions for 2-factors
cites work: Some Theorems on Abstract Graphs
cites work: A note on 2-factors with two components
cites work: Advances on the Hamiltonian problem -- a survey
cites work: Proof of a Packing Conjecture of Bollobás
cites work: On the square of a Hamiltonian cycle in dense graphs
cites work: Blow-up lemma
cites work: An algorithmic version of the blow-up lemma
cites work: Q4242960
cites work: Proof of the Seymour conjecture for large graphs
cites work: Proof of the Alon-Yuster conjecture
cites work: Q4878666
cites work: Q5722819
cites work: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
cites work: Hypergraph Packing and Graph Embedding
cites work: On the number of Hamiltonian cycles in Dirac graphs
cites work: Q4200109
DOI: 10.1016/J.DISC.2007.04.049
description: scientific article; zbMATH DE number 5365257