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

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

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

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

[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 0542546 | Zbl 0417.05040

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

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

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

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

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