Degree sequence conditions for maximally edge-connected graphs and digraphs
Peter Dankelmann, Lutz Volkmann · Journal of Graph Theory · 1997
In this paper we give simple degree sequence conditions for the equality of edge-connectivity and minimum degree of a (di-)graph. One of the conditions implies results by Bollobás, Goldsmith and White, and Xu. Moreover, we give analogue conditions for bipartite (di-)graphs. © 1997 John Wiley & Sons, Inc. J Graph Theory 26:27–34, 1997