×

Minimale \(n\)-fach kantenzusammenhängende Graphen. (German) Zbl 0198.29202


MSC:

05C40 Connectivity
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Halin, R.: A theorem onn-connected graphs. J. Combinatorial Theory7, 150-154 (1969). · Zbl 0172.25803 · doi:10.1016/S0021-9800(69)80049-9
[2] Lick, D.: Critically and minimallyn-connected graphs. In ?The many facets of graph theory? Lectures Notes 110, S. 199-205. Berlin-Heidelberg-New York: Springer 1969.
[3] Mader, W.: Minimalen-fach zusammenhängende Graphen mit maximaler Kantenzahl. Erscheint im J. Reine Angewandte Mathematik. · Zbl 0214.51502
[4] – Existenzn-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte. Erscheint in den Abh. math. Sem. Univ. Hamburg. · Zbl 0215.33803
[5] ?? über den Zusammenhang symmetrischer Graphen. Arch. Math.21, 331-336 (1970). · Zbl 0201.56804 · doi:10.1007/BF01220924
[6] Watkins, M. E.: Connectivity of transitive graphs. J. Combinatorial Theory8, 23-29 (1970). · Zbl 0185.51702 · doi:10.1016/S0021-9800(70)80005-9
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.