On 2-factors with k components

Abstract: In this paper we study the minimum degree condition for a Hamiltonian graph to have a 2-factor with k components. By proving a conjecture of Faudree et al. [A note on 2-factors with two components, Discrete Math. 300 (2005) 218–224] we show the following. There exists a real number such that for every integer there exists an integer such that every Hamiltonian graph G of order with has a 2-factor with k components. [Copyright &y& Elsevier]