Decompositions of complete multigraphs into cycles of varying lengths
classification
🧮 math.CO
keywords
cycleslengthscompleteedge-disjointspecifiedconditionsdecompositiondecompositions
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.