×

Ein Extremalproblem des Zusammenhangs von Graphen. (German) Zbl 0244.05116


MSC:

05C35 Extremal problems in graph theory
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Bollobás, B.: On graphs with at most three independent paths connecting any two vertices. Studia Sci. math. Hungar.1, 137-140 (1966). · Zbl 0144.23301
[2] Erdös, P., Sachs, H.: Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg, math.-naturw. R.12, 251-258 (1963). · Zbl 0116.15002
[3] Harary, F.: Graph Theory. Reading-London: Addison-Wesley 1969. · Zbl 0182.57702
[4] Leonard, J.L.: On graphs with at most four line-disjoint paths connecting any two vertices. J. Combinat. Theory, Ser. B.13, 242-250 (1972). · Zbl 0228.05117
[5] Mader, W.: Existenz gewisser Konfigurationen inn-gesättigten Graphen und in Graphen genügend großer Kantendichte. Math. Ann.194, 295-312 (1971). · Zbl 0219.05071
[6] Mader, W.: Kantendisjunkte Wege in Graphen. Eingereicht bei den Monatsh. Math. · Zbl 0261.05121
[7] Wagner, K.: Graphentheorie. Mannheim: Bibliographisches Institut 1970.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.