Literatur
Anderson, I.: Perfect matchings of a graph. J. Combinatorial Theory10, 183–186 (1971).
Beineke, L., Plummer, M.: On the 1-factors of a non-separable graph. J. Combinatorial Theory2, 285–289 (1967).
Berge, C.: Sur le couplage maximum d'un graphe. C.R. Acad. Sciences247, 258 (1958).
Halin, R.: A theorem onn-connected graphs. J. Combinatorial Theory7, 150–154 (1969).
Halin, R.: Zur Theorie dern-fach zusammenhängenden Graphen. Abh. Math. Sem. Univ. Hamburg33, 133–164 (1969).
Halin, R.: Untersuchungen über minimalen-fach zusammenhängende Graphen. Math. Ann.182, 175–188 (1969).
König, D.: Theorie der endlichen und unendlichen Graphen. Leipzig: Akademische Verlagsgesellschaft 1936.
Mader, W.: Ecken vom Gradn in minimalenn-fach zusammenhängenden Graphen. Arch. Math.23, 219–224 (1972).
Mirsky, L.: Transversal theory. New York, London: Academic Press 1971.
Ore, O.: Theory of graphs. Amer. Math. Soc., Providence 1962.
Tutte, W. T.: The factorization of linear graphs. J. London Math. Soc.22, 107–111 (1947).
Zaks, J.: On the 1-factors ofn-connected graphs. In [13].
Combinatorial structures and their applications. Hrsg. R. Guy, H. Hanani, N. Sauer, J. Schonheim. New York: Gordon and Breach 1970.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mader, W. 1-Faktoren von Graphen. Math. Ann. 201, 269–282 (1973). https://doi.org/10.1007/BF01428195
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01428195