Hamiltonian κ-factors in graphs

Let κ ≥ 2 be an integer. A k-factor F of a graph G is called a hamiltonian k-factor if F contains a Hamiltonian cycle. In this paper, we shall prove that if G is a graph of order n with κ ≥ 2,n ≥ 8κ - 4, κn even and δ(G) ≥ n/2, then G has a hamiltonian k-factor. © 1997 Wiley & Sons, Inc. J Graph Theory 25: 217–227, 1997