Degree sequence conditions for maximally edge-connected graphs depending on the clique number

Peter Dankelmann; Lutz Volkmann

doi:10.1016/S0012-365X(99)00279-4

Degree sequence conditions for maximally edge-connected graphs depending on the clique number

Peter Dankelmann, Lutz Volkmann

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

15 Citations (Scopus)

Abstract

In this paper we give degree sequence conditions for the equality of edge-connectivity and minimum degree of a graph with given clique number.

Original language	English
Pages (from-to)	217-223
Number of pages	7
Journal	Discrete Mathematics
Volume	211
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(99)00279-4
Publication status	Published - 28 Jan 2000
Externally published	Yes

Keywords

Clique number
Degree sequence conditions
Edge-connected graphs

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0012-365X(99)00279-4

Cite this

@article{caeb25f2a8f7436988486bffda9389d0,

title = "Degree sequence conditions for maximally edge-connected graphs depending on the clique number",

abstract = "In this paper we give degree sequence conditions for the equality of edge-connectivity and minimum degree of a graph with given clique number.",

keywords = "Clique number, Degree sequence conditions, Edge-connected graphs",

author = "Peter Dankelmann and Lutz Volkmann",

year = "2000",

month = jan,

day = "28",

doi = "10.1016/S0012-365X(99)00279-4",

language = "English",

volume = "211",

pages = "217--223",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Degree sequence conditions for maximally edge-connected graphs depending on the clique number

AU - Dankelmann, Peter

AU - Volkmann, Lutz

PY - 2000/1/28

Y1 - 2000/1/28

N2 - In this paper we give degree sequence conditions for the equality of edge-connectivity and minimum degree of a graph with given clique number.

AB - In this paper we give degree sequence conditions for the equality of edge-connectivity and minimum degree of a graph with given clique number.

KW - Clique number

KW - Degree sequence conditions

KW - Edge-connected graphs

UR - http://www.scopus.com/inward/record.url?scp=0042281939&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(99)00279-4

DO - 10.1016/S0012-365X(99)00279-4

M3 - Article

AN - SCOPUS:0042281939

SN - 0012-365X

VL - 211

SP - 217

EP - 223

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Degree sequence conditions for maximally edge-connected graphs depending on the clique number

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this