Two-factorizations of small complete graphs (Q1569867)

A 2-factor is a spanning 2-regular subgraph and a 2-factorization is a partition of the edge set into 2-factors. The type of a 2-factor of an \(n\)-vertex graph \(G\) is a partition of \(n\) into parts no less than 3. The type of a 2-factorization is a list of the types of the 2-factors in it, presented in nondecreasing order, assuming an order on the types of the 2-factors. This paper enumerates all 2-factorizations classified by type for the complete graph on nine vertices, and for 2-factorizations of selected types of the complete graph on 11 vertices.