Literatur
Baebler, F.: Über die Zerlegung regulärer Streckenkomplexe ungerader Ordnung. Comment. Math. Helv.10, 275–287 (1938).
Belck, H. B.: Reguläre Faktoren von Graphen. J. reine angew. Math.188, 228–252 (1950).
Everett, C. J., andG. Whaples: Representation of sequences of sets. Am. J. Math.71, 287–293 (1949).
Gallai, T.: On factorisation of graphs. Acta Math. Hung.1, 133–153 (1950).
Hall, P.: On representation of subsets. J. London Math. Soc.10, 26–30 (1934).
Halmos, P.R., andH. E. Vaughan: The marriage problem. Am. J. Math.72, 214–215 (1950).
Kaluza, Th. jr.: Ein Kriterium für das Vorhandensein von Faktoren in beliebigen Graphen. Math. Ann.126, 464–466 (1953).
König, D.: Theorie der endlichen und unendlichen Graphen. Leipzig 1936.
Ore, O.: Graphs and subgraphs. Trans. Am. Math. Soc.84, 109–136 (1957).
Petersen, J.: Die Theorie der regulären Graphen. Acta Math.15, 193–220 (1891).
Tutte, W. T.: The factorisation of linear graphs. J. London Math. Soc.22, 107–111 (1947).
—— The factorisation of locally finite graphs. Canad. J. Math.2, 44–49 (1950).
—— The factors of graphs. Canad. J. Math.4, 314–328 (1952).
—— A short proof of the factor theorem for finite graphs. Canad. J. Math.6, 347–352 (1954).
Wagner, K.: Faktorklassen in Graphen. Math. Ann.141, 49–67 (1960).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jung, H.A. Maximal-Г-prime Graphen. Math. Ann. 153, 210–226 (1964). https://doi.org/10.1007/BF01360317
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01360317