Bibliography

1

B. Alspach and S. Marshall, Even cycle decompositions of complete graphs minus a 1-factor, J. of Combin. Designs 6 (1994) 441-458.

2

E. Bell, Decomposition of K_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, eds. J.H. Dinitz and D.R. Stinson, Wiley, New York (1992) 325-369.

9

E. Lucas, Récréationes Mathématiques, vol. II, Gauthier-Villars, Paris, 1892.

10

D. Sotteau, Decompositions of K_m,n (K_m,n^*) into cycles (circuits) of length 2k, J. Combin. Theory Ser. B 29 (1981) 75-81.

11

M. Tarsi, Decomposition of a complete multigraph into simple paths: Nonbalanced handcuffed designs, J. Combin. Theory Ser. A 34 (1983) 60-70.

12

R.M. Wilson, construction and uses of pairwise balanced designs, Math. Centre Tracts 55 (1974) 18-41.