Skip to main content
Log in

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. These concepts will be used here only in the combinatorial sense.

  2. D. König, Theorie der endlichen und unendlichen Graphen, Akad. Verl. Leipzig (1936), pp. 155–159.

    Google Scholar 

  3. J. Petersen, Die Theorie der regulären Graphs,Acta Math.,15 (1891), pp. 193–220.

    Google Scholar 

  4. F. Baebler, Über die Zerlegung regulärer Streckenkomplexe ungerader Ordnung,Comment. Math. Helvetici,10 (1938), pp. 275–287.

    Google Scholar 

  5. W. T. Tutte, The factorization of linear graphs,Journ. London Math. Soc.,22 (1947), pp. 107–111.

    Google Scholar 

  6. Loc. cit. 2, pp. 170–175. A graph is said to be ofeven circuit, or, simplyeven, if it has no circle with an odd number of edges.

    Google Scholar 

  7. P. Hall, On representations of subsets,Journ. London Math. Soc. 10 (1934), pp. 26–30.

    Google Scholar 

  8. R. Rado, Factorization of even graphs,Quart. Journ. Math. (Oxford series),20 (1949), pp. 95–104.

    Google Scholar 

  9. D. König undS. Valkó, Über mehrdeutige Abbildungen von Mengen,Math. Annalen,95 (1926), pp. 135–138.

    Google Scholar 

  10. D. König, loc. cit. 2, pp. 203–205.

    Google Scholar 

  11. W. T. Tutte, The factorisation of locally finite graphs,Canadian Journ. Math.,2 (1950), pp. 44–49.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gallai, T. On factorisation of graphs. Acta Mathematica Academiae Scientiarum Hungaricae 1, 133–153 (1950). https://doi.org/10.1007/BF02022560

Download citation

  • Issue Date:

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

Navigation