Cycle decompositions III: Complete graphs and fixed length cycles

Journal of Combinatorial Designs

Volumn 10, Issue 1, 2002, Pages 27-78

  Šajna, Mateja ^a  

^a Capilano College   (Canada)

Author keywords

Complete graph; Cycle; Decomposition

Indexed keywords

EID: 0037693109     PISSN: 10638539     EISSN: 15206610     Source Type: Journal    
DOI: 10.1002/jcd.1027     Document Type: Article

References (12)

1. B. Alspach, H. Gavlas, Cycle decompositions of Kn and Kn y I, J Combin Theory Ser B 81 (2001), 77-99.
2. B. Alspach, B. N. Varma, Decomposing complete graphs into cycles of length 2pe, Ann. Discrete Math 9 (1980), 155-162.
3. E. Bell, Decomposition of a complete graph into cycles of length less than or equal to 50, M.Sc. thesis, Auburn University, 1991.
4. J.-C. Bermond, O. Favaron, M. Maheo, Hamiltonian decomposition of Cayley graphs of degree 4, J Combin Theory Ser B 46 (1989), 142-153.
5. S. I. El-Zanati, Maximum packings with odd cycles, Discrete Math 131 (1994), 91-97.
6. D. G. Hoffman, C. C. Lindner, C. A. Rodger, On the construction of odd cycle systems, J Graph Theory 13 (1989), 417-426.
7. A. Kotzig, On decompositions of the complete graph into 4k-gons, Mat-Fiz Cas 15 (1965), 227-233.
8. C. C. Lindner, C. A. Rodger, Decomposition into cycles II: Cycle systems,'' in Contemporary Design Theory: A Collection of Surveys, J. H. Dinitz and D. R. Stinson (Editors), Wiley, New York, 1992, pp. 325-369.
9. C. A. Rodger, Graph decompositions, Proc Second Internat Catania Combin Conf, Le Matematische 45 (1990), 119-140.
10. A. Rosa, On cyclic decompositions of the complete graph into .4m . 2.-gons, Mat-Fyz C as 16 (1966), 349-352.
11. M. Šajna, Cycle Decompositions of Kn and Kn I, PhD thesis, Simon Fraser University, 1999.
12. M. Šajna, On decomposing Kn y I into cycles of a fixed odd length, Discrete Math (to appear).