1. [1] C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
2. [2] J. C. Bermond and D. Sotteau, Graph decomposition and (/-design, Proc. 5th British CombinatorialConference, Aberdeen (1975), 53-72.
3. [3] J. C. Bermond and J. Schonheim, G-decomposition of Kn, where G has four vertices or less, Discrete Math. 19 (1977), 113-120.
4. [4] J. C. Bermond, C. Huang and D. Sotteau, Balanced cycle and circuit designs: even cases, Ars Combinatoria 5 (1978), 239-318.
5. [5] P. Cain, Decomposition of complete graphs into stars, Bull. Austral. Math. Soc. 10 (1974), 23-30.