On the minimum degree and edge-connectivity of a graph

Previous | Up | Next

Article

On the minimum degree and edge-connectivity of a graph. (English). Časopis pro pěstování matematiky, vol. 101 (1976), issue 2, pp. 199-202

References:

[1] M. Behzad G. Chartrand: Introduction to the Theory of Graphs. Allyn and Bacon, Inc., Boston 1971. MR 0432461

[2] R. Halin: A theorem on $n$-connected graphs. J. Combinatorial Theory 7 (1969), 150-154. MR 0248042 | Zbl 0172.25803

[3] D. R. Lick: Minimally $n$-line connected graphs. J. reine angew. Math. 252 (1972), 178-182. MR 0291003 | Zbl 0233.05118

[4] L. Nebeský: An upper bound for the minimum degree of a graph. (submitted to publication).

Partner of