DEGREE SEQUENCE CONDITIONS FOR MAXIMALLY EDGE-CONNECTED GRAPHS AND DIGRAPHS

Authors
DANKELMANN P VOLKMANN L
Citation
P. Dankelmann et L. Volkmann, DEGREE SEQUENCE CONDITIONS FOR MAXIMALLY EDGE-CONNECTED GRAPHS AND DIGRAPHS, Journal of graph theory, 26(1), 1997, pp. 27-34
Citations number
16
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
Journal of graph theory → ACNP
ISSN journal
03649024
Volume
26
Issue
1
Year of publication
1997
Pages
27 - 34
Database
ISI
SICI code
0364-9024(1997)26:1<27:DSCFME>2.0.ZU;2-B
Abstract
In this paper we give simple degree sequence conditions for the equali ty of edge-connectivity and minimum degree of a (di-)graph. One of the conditions implies results by Bollobas, Goldsmith and White, and Xu. Moreover, we give analogue conditions for bipartite (di-)graphs. (C) 1 997 John Wiley & Sons, Inc.