Toughness, minimum degree, and the existence of 2‐factors
D. Bauer, Edward F. Schmeichel · Journal of Graph Theory · 1994
Abstract Degree conditions on the vertices of a t‐tough graph G(1 ≦ t ≦ 2) that ensure the existence of a 2‐factor in G are presented. These conditions are asymptotically best possible for every t ϵ [1, 3/2] and for infinitely many t ϵ [3/2, 2].