References
J. C. Bermond and J. Schönheim,G-decomposition ofK n, whereG has four vertices or less,Discrete Math.,19 (1977), 113–120.
J. A. Bondy and U. S. R. Murty,Graph Theory with Applications, The Macmillan Press Ltd. (London and Basingstoke, 1978), p. 97.
A. Bialostocki and Y. Roditty, 3K 2-decomposition of a graph,Acta Math. Acad. Sci. Hungar.,40 (1982), 201–208.
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.
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.
R. M. Wilson, Decomposition of complete graphs into subgraphs isomorphic to a given graph,Proc. 5th British Combinatorial Conference (Aberdeen, 1975), pp. 647–659.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Alon, N. A note on the decomposition of graphs into isomorphic matchings. Acta Math Hung 42, 221–223 (1983). https://doi.org/10.1007/BF01956769
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01956769