1. J. C. Bermond and J. Schönheim,G-decomposition ofK n, whereG has four vertices or less,Discrete Math.,19 (1977), 113–120.
2. J. A. Bondy and U. S. R. Murty,Graph Theory with Applications, The Macmillan Press Ltd. (London and Basingstoke, 1978), p. 97.
3. A. Bialostocki and Y. Roditty, 3K 2-decomposition of a graph,Acta Math. Acad. Sci. Hungar.,40 (1982), 201–208.
4. S. Fiorini and R. J. Wilson, Edge coloring of graphs, inSelected Topics in Graph Theory (ed. L. W. Beineke and R. J. Wilson) Academic Press (London, New York and San Francisco, 1978), pp. 103–126.
5. J. Folkman and D. R. Fulkerson, Edge coloring in bipartite graphs, inCombinatorial Mathematics and its Applications (ed. R. C. Bose and T. A. Dowling), The University of North Carolina Press (1967), pp. 561–577.