Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs

Darryn Bryant, Andrea Burgess, Peter Danziger


It is shown that if $G$ is any bipartite 2-regular graph of order at most $n/2$ or at least $n-2$, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order $n$ into a perfect matching and edge-disjoint copies of $G$.


Graph Theory, Graph Decompositions

Full Text: