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

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI MR   Zbl

DOI : 10.21136/CPM.1976.117895
Classification : 05C35 
Nebeský, Ladislav. On the minimum degree and edge-connectivity of a graph. Časopis pro pěstování matematiky, Tome 101 (1976) no. 2, pp. 199-202. doi: 10.21136/CPM.1976.117895
@article{10_21136_CPM_1976_117895,
     author = {Nebesk\'y, Ladislav},
     title = {On the minimum degree and edge-connectivity of a graph},
     journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
     pages = {199--202},
     year = {1976},
     volume = {101},
     number = {2},
     doi = {10.21136/CPM.1976.117895},
     mrnumber = {0450110},
     zbl = {0328.05126},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1976.117895/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - On the minimum degree and edge-connectivity of a graph
JO  - Časopis pro pěstování matematiky
PY  - 1976
SP  - 199
EP  - 202
VL  - 101
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1976.117895/
DO  - 10.21136/CPM.1976.117895
LA  - en
ID  - 10_21136_CPM_1976_117895
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T On the minimum degree and edge-connectivity of a graph
%J Časopis pro pěstování matematiky
%D 1976
%P 199-202
%V 101
%N 2
%U http://geodesic.mathdoc.fr/articles/10.21136/CPM.1976.117895/
%R 10.21136/CPM.1976.117895
%G en
%F 10_21136_CPM_1976_117895

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

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

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

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

Cité par Sources :