Almost resolvable decompositions of \(2K_ n\) into cycles of odd length (Q1825884)

An m-cycle decomposition of a graph G is defined to be an ordered pair (G,C(m)), where C(m) is a collection of edge-disjoint m-cycles which partition the edge set of G. A subgraph H of G is called an almost parallel class if for some vertex v of G, the graph H is a 2-factor of G- v. Finally, an m-cycle decomposition (G,C(m)) is said to be almost resolvable if C(m) can be partitioned into almost parallel classes. (The terminology comes from the fact that an m-cycle decomposition (G,C(m)) has been defined to be resolvable if the cycles in C(m) can be partitioned into 2-factors of G.) Theorem. There exists an almost resolvable m-cycle decomposition of \(2K_{ms+1}\) for all odd \(m\geq 3\) and all \(s\geq 1\), where \(2K_{sm+1}\) is the graph with \(ms+1\) vertices, each pair of which is joined by two edges.