Hamiltonian problems and the forbidden subgraph method

A graph is ;Let us say that for some graph ;Finally, we look at the existence of a decomposition of certain classes of graphs into 2-factors consisting of k disjoint circles. A theorem of Corradi and Hajnal (8) is used to assure the existence of k disjoint cycles in the graphs with...