Decompositions of complete multigraphs into cycles of varying lengths

2015/08/04 by Darryn Bryant, Daniel Horsley, Bryant, Darryn +5
Mathematics · #05B30 #05C38 (Secondary) #05C51 (Primary) #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05B30 #msc:05C38 #msc:05C51

paper · pdf · doi:10.48550/arxiv.1508.00645

arxiv created 2015/08/04 · arxiv updated 2015/08/05

Abstract

We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.

Related

• Cycle packings of the complete multigraph
• Decomposition of a complete bipartite multigraph into arbitrary cycle sizes
• Resolvable Cycle Decompositions of Complete Multigraphs and Complete\n Equipartite Multigraphs via Layering and Detachment
• Decomposing various graphs into short even-length cycles
• Decomposing K_u+w-K_u into cycles of various lengths