Cycle packings of the complete multigraph
From MaRDI portal
Publication:4622608
zbMath1405.05142arXiv1701.05287MaRDI QIDQ4622608
Publication date: 13 February 2019
Full work available at URL: https://arxiv.org/abs/1701.05287
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Cites Work
- Decompositions of complete multigraphs into cycles of varying lengths
- Packing cycles in complete graphs
- Maximum packings with odd cycles
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- On the Alspach Conjecture
- Cycle decompositions III: Complete graphs and fixed length cycles
- Maximum packings of the complete graph with uniform length cycles
- Decompositions of complete graphs into long cycles
- Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
- Cycle decompositions of complete multigraphs
- Cycle decompositions of complete multigraphs
This page was built for publication: Cycle packings of the complete multigraph