1. J. C. Bermond and J. Schönheim,G-decomposition ofKn, whereG has four vertices or less,Discrete Math.,19 (1977), 113–130.
2. J. C. Bermond and D. Sotteau, Graph decomposition andG-designs. In:Proc. 5th British Combinatorial Conf. (1975), 53–72.
3. Y. Caro, The decomposition of graphs into graphs having two edges. (Unpublished paper.)
4. Y. Caro and J. Schönheim, Decomposition of trees into isomorphic subtrees,Ars. Combinatoria,9 (1980), 119–130.
5. E. J. Cockayne and B. L. Hartnell, Edge partition of complete multipartite graphs into equal length circuits. In:Proc. 5th British Combinatorial Conf. (1975), 131–134.