Cycle Decompositions of Kn and Kn - I

Journal of Combinatorial Theory. Series B

Volumn 81, Issue 1, 2001, Pages 77-99

  Alspach, Brian ^a   Gavlas, Heather ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b GRAND VALLEY STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038030944     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2000.1996     Document Type: Article

References (13)

1. B. Alspach and S. Marshall, Even cycle decompositions of complete graphs minus a 1-factor, J. Combin. Des. 6 (1994), 441-458.
2. n into cycles of length at most fifty, Ars Combin. 40 (1995), 49-58.
3. J.-C. Bermond, O. Favaron, and M. Maheo, Hamiltonian decomposition of Cayley graphs of degree 4, J. Combin. Theory Ser. B 46 (1989), 142-153.
4. J.-C. Bermond, C. Huang, and D. Sotteau, Balanced cycle and circuit designs: Even cases, Ars Combin. 5 (1978), 293-318.
5. J.-C. Bermond and D. Sotteau, Balanced cycle and circuit designs: Odd cases, Proc. Colloq. Oberhof Ilmenau (1978), 11-32.
6. R. Häggkvist, A lemma on cycle decompositions, Ann. Discrete Math. 27 (1985), 227-232.
7. D. G. Hoffman, C. C. Linder, and C. A. Rodger, On the construction of odd cycle systems, J. Graph Theory 13 (1989), 417-426.
8. C. C. Linder and C. A. Rodger, Decomposition into cycles. II. Cycle systems, in "Contemporary Design Theory: A Collection of Surveys" (J. H. Dinitz and D. R. Stinson, Eds.), pp. 325-369, Wiley, New York, 1992.
9. E. Lucas, "Récréations Mathématiques," Vol. II, Gauthier-Villars, Paris, 1892.
10. n - I" Ph.D. thesis, Simon Fraser University, July 1999.
11. m, n) into cycles (circuits) of length 2k, J. Combin. Theory Ser. B 29 (1981), 75-81.
12. M. Tarsi, Decomposition of a complete multigraph into simple paths: Nonbalanced handcuffed designs, J. Combin. Theory Ser. A 34 (1983), 60-70.
13. R. M. Wilson, Construction and uses of pairwise balanced designs, Math. Centre Tracts 55 (1974), 18-41.