Cycle decompositions of complete multigraphs
- 12 June 2009
- journal article
- research article
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 18 (2) , 85-93
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Existence of 1-Rotational k -Cycle Systems of the Complete GraphGraphs and Combinatorics, 2004
- Cycle decompositions IV: complete directed graphs and fixed length directed cyclesJournal of Combinatorial Theory, Series A, 2003
- Existence of cyclic k-cycle systems of the complete graphDiscrete Mathematics, 2003
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systemsJournal of Combinatorial Designs, 2003
- Cycle decompositions III: Complete graphs and fixed length cyclesJournal of Combinatorial Designs, 2001
- Cycle Decompositions of K and K−IJournal of Combinatorial Theory, Series B, 2001
- Another class of balanced graph designs: balanced circuit designsDiscrete Mathematics, 1975
- On the existence of balanced bipartite designs, IIDiscrete Mathematics, 1974
- The Existence and Construction of Balanced Incomplete Block DesignsThe Annals of Mathematical Statistics, 1961