Skip to main content
Log in

A note on the decomposition of graphs into isomorphic matchings

  • Published:
Acta Mathematica Hungarica Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. J. C. Bermond and J. Schönheim,G-decomposition ofK n, whereG has four vertices or less,Discrete Math.,19 (1977), 113–120.

    Article  Google Scholar 

  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. A. Bialostocki and Y. Roditty, 3K 2-decomposition of a graph,Acta Math. Acad. Sci. Hungar.,40 (1982), 201–208.

    Article  Google Scholar 

  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. 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.

  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.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01956769

Navigation