arXiv Analytics

Sign in

arXiv:1508.00645 [math.CO]AbstractReferencesReviewsResources

Decompositions of complete multigraphs into cycles of varying lengths

Darryn Bryant, Daniel Horsley, Barbara Maenhaut, Benjamin R. Smith

Published 2015-08-04Version 1

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.

Categories: math.CO
Subjects: 05C51, 05B30, 05C38
Related articles: Most relevant | Search more
arXiv:1701.05287 [math.CO] (Published 2017-01-19)
Cycle packings of the complete multigraph
arXiv:1607.01456 [math.CO] (Published 2016-07-06)
Decomposing 8-regular graphs into paths of length 4
arXiv:1611.03244 [math.CO] (Published 2016-11-10)
A $\overrightarrow{P_{3}}$-decomposition of tournaments and bipartite digraphs

Links

Toolbox