Geodesic
An upper bound for the minimum degree of a graph
Czechoslovak Mathematical Journal, Tome 27 (1977) no. 3, pp. 460-466
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1977.101482
Classification : 05C99 
@article{10_21136_CMJ_1977_101482,
     author = {Nebesk\'y, Ladislav},
     title = {An upper bound for the minimum degree of a graph},
     journal = {Czechoslovak Mathematical Journal},
     pages = {460--466},
     year = {1977},
     volume = {27},
     number = {3},
     doi = {10.21136/CMJ.1977.101482},
     mrnumber = {0465950},
     zbl = {0384.05049},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1977.101482/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - An upper bound for the minimum degree of a graph
JO  - Czechoslovak Mathematical Journal
PY  - 1977
SP  - 460
EP  - 466
VL  - 27
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1977.101482/
DO  - 10.21136/CMJ.1977.101482
LA  - en
ID  - 10_21136_CMJ_1977_101482
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T An upper bound for the minimum degree of a graph
%J Czechoslovak Mathematical Journal
%D 1977
%P 460-466
%V 27
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1977.101482/
%R 10.21136/CMJ.1977.101482
%G en
%F 10_21136_CMJ_1977_101482
Nebeský, Ladislav. An upper bound for the minimum degree of a graph. Czechoslovak Mathematical Journal, Tome 27 (1977) no. 3, pp. 460-466. doi: 10.21136/CMJ.1977.101482

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

[2] G. Chartrand A. Kaugars, D. R. Lick: Critically $n$-connected graphs. Proc. Amer. Math. Soc. 32 (1972), 63-68. | MR

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

[4] R. Halin: On the structure of $n$-connected graphs. Recent Progress in Combinatorics (W. T. Tutte, ed.). Academic Press, New York and London 1969, pp. 91 - 102. | MR | Zbl

[5] F. Harary: Graph Theory. Addison-Wesley, Reading 1969. | MR | Zbl

[6] W. Mader: Eine Eigenschaft der Atome endlicher Graphen. Archiv Math. 22 (1971), 333 - 336. | DOI | MR | Zbl

[7] L. Nebeský: A theorem on 2-connected graphs. Časopis pěst. mat. 100 (1975), 116-117. | MR

Cité par Sources :