@article{Bucic20202factorsWK,
title={2-factors with k cycles in Hamiltonian graphs},
author={Matija Buci'c and Erik Jahn and Alexey Pokrovskiy and Benny Sudakov},
journal={J. Comb. Theory, Ser. B},
year={2020},
volume={144},
pages={150-166}
}

It is proved that for k ≤ (n/4), Ore's classical condition for a graph to be hamiltonian implies that the graph contains a 2-factor with exactly k components.Expand

For any positive integer k, we investigate degree conditions implying that a graph G of order n contains a 2-factor with exactly k components (vertex disjoint cycles). In particular, we prove that… Expand

It is proved that to everyl andr there is anε(l, r) so that forn>n0 everyr-graph ofn vertices andnr−ε( l, r), which means that all ther-tuples occur in ther-graph.Expand

This article contains some material on related topics such as traceable, hamiltonian-connected and pancyclic graphs and digraphs, as well as an extensive bibliography of papers in the area.Expand