Chvátal-Erdős condition for 2-factors with at most two components in graphs

Tao Tian, Liming Xiong, Weigen Yan

It is well-known that Chvátal and Erdős stated that any graph of order at least three whose independence number is no greater than its connectivity is Hamiltonian; that any graph…