References
These concepts will be used here only in the combinatorial sense.
D. König, Theorie der endlichen und unendlichen Graphen, Akad. Verl. Leipzig (1936), pp. 155–159.
J. Petersen, Die Theorie der regulären Graphs,Acta Math.,15 (1891), pp. 193–220.
F. Baebler, Über die Zerlegung regulärer Streckenkomplexe ungerader Ordnung,Comment. Math. Helvetici,10 (1938), pp. 275–287.
W. T. Tutte, The factorization of linear graphs,Journ. London Math. Soc.,22 (1947), pp. 107–111.
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.
P. Hall, On representations of subsets,Journ. London Math. Soc. 10 (1934), pp. 26–30.
R. Rado, Factorization of even graphs,Quart. Journ. Math. (Oxford series),20 (1949), pp. 95–104.
D. König undS. Valkó, Über mehrdeutige Abbildungen von Mengen,Math. Annalen,95 (1926), pp. 135–138.
D. König, loc. cit. 2, pp. 203–205.
W. T. Tutte, The factorisation of locally finite graphs,Canadian Journ. Math.,2 (1950), pp. 44–49.
Author information
Authors and Affiliations
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/BF02022560