Degree Sequence Conditions for Maximally Edge-Connected Graphs and Digraphs

Peter Dankelmann; Lutz Volkmann

doi:10.1002/(SICI)1097-0118(199709)26:1<27::AID-JGT4>3.0.CO;2-J

Degree Sequence Conditions for Maximally Edge-Connected Graphs and Digraphs

Peter Dankelmann
, Lutz Volkmann

Research output: Contribution to journal › Article › peer-review

28 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	27-34
Number of pages	8
Journal	Journal of Graph Theory
Volume	26
Issue number	1
DOIs	https://doi.org/10.1002/(SICI)1097-0118(199709)26:1<27::AID-JGT4>3.0.CO;2-J
Publication status	Published - Sept 1997
Externally published	Yes

Keywords

Degree sequence
Edge-connectivity
Graph

ASJC Scopus subject areas

Geometry and Topology

Access to Document

10.1002/(SICI)1097-0118(199709)26:1<27::AID-JGT4>3.0.CO;2-J

Cite this

@article{56accf407d8d47279a66587ac2386052,

title = "Degree Sequence Conditions for Maximally Edge-Connected Graphs and Digraphs",

abstract = "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{\'a}s, Goldsmith and White, and Xu. Moreover, we give analogue Conditions for bipartite (di-)graphs.",

keywords = "Degree sequence, Edge-connectivity, Graph",

author = "Peter Dankelmann and Lutz Volkmann",

year = "1997",

month = sep,

doi = "10.1002/(SICI)1097-0118(199709)26:1<27::AID-JGT4>3.0.CO;2-J",

language = "English",

volume = "26",

pages = "27--34",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "1",

}

TY - JOUR

T1 - Degree Sequence Conditions for Maximally Edge-Connected Graphs and Digraphs

AU - Dankelmann, Peter

AU - Volkmann, Lutz

PY - 1997/9

Y1 - 1997/9

N2 - 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.

AB - 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.

KW - Degree sequence

KW - Edge-connectivity

KW - Graph

UR - https://www.scopus.com/pages/publications/0031518422

U2 - 10.1002/(SICI)1097-0118(199709)26:1<27::AID-JGT4>3.0.CO;2-J

DO - 10.1002/(SICI)1097-0118(199709)26:1<27::AID-JGT4>3.0.CO;2-J

M3 - Article

AN - SCOPUS:0031518422

SN - 0364-9024

VL - 26

SP - 27

EP - 34

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 1

ER -

Degree Sequence Conditions for Maximally Edge-Connected Graphs and Digraphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this