| Title:
|
On the minimum degree and edge-connectivity of a graph (English) |
| Author:
|
Nebeský, Ladislav |
| Language:
|
English |
| Journal:
|
Časopis pro pěstování matematiky |
| ISSN:
|
0528-2195 |
| Volume:
|
101 |
| Issue:
|
2 |
| Year:
|
1976 |
| Pages:
|
199-202 |
| . |
| Category:
|
math |
| . |
| MSC:
|
05C35 |
| idZBL:
|
Zbl 0328.05126 |
| idMR:
|
MR0450110 |
| DOI:
|
10.21136/CPM.1976.117895 |
| . |
| Date available:
|
2009-09-23T08:43:41Z |
| Last updated:
|
2020-07-29 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/117895 |
| . |
| Reference:
|
[1] M. Behzad G. Chartrand: Introduction to the Theory of Graphs.Allyn and Bacon, Inc., Boston 1971. MR 0432461 |
| Reference:
|
[2] R. Halin: A theorem on $n$-connected graphs.J. Combinatorial Theory 7 (1969), 150-154. Zbl 0172.25803, MR 0248042 |
| Reference:
|
[3] D. R. Lick: Minimally $n$-line connected graphs.J. reine angew. Math. 252 (1972), 178-182. Zbl 0233.05118, MR 0291003 |
| Reference:
|
[4] L. Nebeský: An upper bound for the minimum degree of a graph.(submitted to publication). |
| . |
