A note on the decomposition of graphs into isomorphic matchings
- 34 Downloads
Unable to display preview. Download preview PDF.
- J. A. Bondy and U. S. R. Murty,Graph Theory with Applications, The Macmillan Press Ltd. (London and Basingstoke, 1978), p. 97.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- R. M. Wilson, Decomposition of complete graphs into subgraphs isomorphic to a given graph,Proc. 5th British Combinatorial Conference (Aberdeen, 1975), pp. 647–659.Google Scholar
© Akadémiai Kiadó 1983