An asymptotic solution to the cycle decomposition problem for complete graphs
- 30 November 2010
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 117 (8) , 1258-1284
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Decompositions of complete graphs into long cyclesBulletin of the London Mathematical Society, 2009
- Packing cycles in complete graphsJournal of Combinatorial Theory, Series B, 2008
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositionsJournal of Combinatorial Theory, Series B, 2005
- Packing closed trails into dense graphsJournal of Combinatorial Theory, Series B, 2003
- Skolem-type Difference Sets for Cycle SystemsThe Electronic Journal of Combinatorics, 2003
- Packing Circuits into KNCombinatorics, Probability and Computing, 2001
- On the Alspach ConjectureCombinatorics, Probability and Computing, 2001
- Cycle Decompositions of K and K−IJournal of Combinatorial Theory, Series B, 2001
- On Alspach's conjecture with two even cycle lengthsDiscrete Mathematics, 2000
- Research problemsDiscrete Mathematics, 1981