✦ LIBER ✦

Degree sequence conditions for maximally edge-connected graphs and digraphs

✍ Scribed by Dankelmann, Peter; Volkmann, Lutz

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 88 KB
Volume: 26
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199709)26:1<27::aid-jgt4>3.0.co;2-j

No coin nor oath required. For personal study only.

✦ Synopsis

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.