A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition

Chvatal and Erdos showed that a k-connected graph with independence number at most k and order at least three is hamiltonian. In this paper, we show that a graph contains a 2-factor with two components, i.e., the graph can be divided into two cycles if the graph is k(≥ 4)-connected with order at least six and independence number at most k. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 269–279, 2003