Decompositions of Complete Multipartite Graphs into Cycles of Even Length
- Cite this article as:
- Cavenagh, N. & Billington, E. Graphs Comb (2000) 16: 49. doi:10.1007/s003730050003
Necessary and sufficient conditions for the existence of an edge-disjoint decomposition of any complete multipartite graph into even length cycles are investigated. Necessary conditions are listed and sufficiency is shown for the cases when the cycle length is 4, 6 or 8. Further results concerning sufficiency, provided certain “small” decompositions exist, are also given for arbitrary even cycle lengths.