Geodesic
On equality of edge-connectivity and minimum degree of a graph
Archivum mathematicum, Tome 25 (1989) no. 1-2, pp. 19-25 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C35, 05C38, 05C40 
@article{ARM_1989_25_1-2_a3,
     author = {Plesn{\'\i}k, J\'an and Zn\'am, \v{S}tefan},
     title = {On equality of edge-connectivity and minimum degree of a graph},
     journal = {Archivum mathematicum},
     pages = {19--25},
     year = {1989},
     volume = {25},
     number = {1-2},
     mrnumber = {1189195},
     zbl = {0731.05035},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ARM_1989_25_1-2_a3/}
}
TY  - JOUR
AU  - Plesník, Ján
AU  - Znám, Štefan
TI  - On equality of edge-connectivity and minimum degree of a graph
JO  - Archivum mathematicum
PY  - 1989
SP  - 19
EP  - 25
VL  - 25
IS  - 1-2
UR  - http://geodesic.mathdoc.fr/item/ARM_1989_25_1-2_a3/
LA  - en
ID  - ARM_1989_25_1-2_a3
ER  - 
%0 Journal Article
%A Plesník, Ján
%A Znám, Štefan
%T On equality of edge-connectivity and minimum degree of a graph
%J Archivum mathematicum
%D 1989
%P 19-25
%V 25
%N 1-2
%U http://geodesic.mathdoc.fr/item/ARM_1989_25_1-2_a3/
%G en
%F ARM_1989_25_1-2_a3
Plesník, Ján; Znám, Štefan. On equality of edge-connectivity and minimum degree of a graph. Archivum mathematicum, Tome 25 (1989) no. 1-2, pp. 19-25. http://geodesic.mathdoc.fr/item/ARM_1989_25_1-2_a3/

[1] M. Behzad G. Chartrand, L. Lesniak-Foster: Graphs and Digraphs. Prindle, Weber and Schmidt, Boston, 1979. | MR

[2] B. Bollobás: On graphs with equal edge connectivity and minimum degree. Discrete Math. 28 (1979), 321-323. | MR

[3] G. Chartrand: A graph-theoretical approach to a communications problem. SIAM J. Appl. Math. 14 (1966), 778-781. | MR

[4] A. H. Esfahanian: Lower bounds on the connectivities of a graph. J. Graph Theory 9 (1985), 503-511. | MR | Zbl

[5] D. L. Goldsmith, R. C. Entringer: A sufficient condition for equality of edge-connectivity and minimum degree of a graph. J. Graph Theory 3 (1979), 251-255. | MR | Zbl

[6] L. Lesniak: Results on the edge-connectivity of graphs. Discrete Math. 8 (1974), 351-354. | MR | Zbl

[7] J. Plesník: Critical graphs of given diameter. Acta Fac. R. N. Univ. Comen. Math. 30 (1975), 71-93. | MR

[8] T. Soneoka H. Nakada M. Imase, C. Peyrat: Sufficient conditions for maximally connected dense graphs. preprint. | MR

[9] L. Volkmann: Bemerkungen zum p-fachen Kantenzusammenhang von Graphen. An. Univ. Bucuresti Mat., to appear. | MR | Zbl

[10] L. Volkmann: Edge-connectivity in partite graphs. J. Graph Theory, to appear.