Acta Mathematica Hungarica

, Volume 42, Issue 3–4, pp 221–223 | Cite as

A note on the decomposition of graphs into isomorphic matchings

Article

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. C. Bermond and J. Schönheim,G-decomposition ofK n, whereG has four vertices or less,Discrete Math.,19 (1977), 113–120.CrossRefGoogle Scholar
  2. [2]
    J. A. Bondy and U. S. R. Murty,Graph Theory with Applications, The Macmillan Press Ltd. (London and Basingstoke, 1978), p. 97.Google Scholar
  3. [3]
    A. Bialostocki and Y. Roditty, 3K 2-decomposition of a graph,Acta Math. Acad. Sci. Hungar.,40 (1982), 201–208.CrossRefGoogle Scholar
  4. [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.Google Scholar
  5. [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.Google Scholar
  6. [6]
    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

Copyright information

© Akadémiai Kiadó 1983

Authors and Affiliations

  • N. Alon
    • 1
  1. 1.Department of MathematicsMassachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations