Decompositions of complete multigraphs into cycles of varying lengths
- 1 March 2018
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 129, 79-106
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Australian Research Council (DP150100530, DP150100506, DP120100790, DP120103067, DE120100040, DP130102987)
This publication has 19 references indexed in Scilit:
- An asymptotic solution to the cycle decomposition problem for complete graphsJournal of Combinatorial Theory, Series A, 2010
- Cycle decompositions of complete multigraphsJournal of Combinatorial Designs, 2010
- Decompositions of complete graphs into long cyclesBulletin of the London Mathematical Society, 2009
- Cycle decompositions of complete multigraphsJournal of Combinatorial Designs, 2009
- Decompositions of complete graphs into triangles and Hamilton cyclesJournal of Combinatorial Designs, 2004
- Hamilton cycle rich two‐factorizations of complete graphsJournal of Combinatorial Designs, 2004
- On the construction of odd cycle systemsJournal of Graph Theory, 1989
- Research problemsDiscrete Mathematics, 1981
- Another class of balanced graph designs: balanced circuit designsDiscrete Mathematics, 1975
- The Existence and Construction of Balanced Incomplete Block DesignsThe Annals of Mathematical Statistics, 1961