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

Peter Dankelmann, Lutz Volkmann

Discrete Math. 211 (2000), no. 1-3, 217--223.

BibTex references

@Article\{DV00,

author = "Dankelmann, Peter and Volkmann, Lutz",

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

journal = "Discrete Math.",

number = "1-3",

volume = "211",

pages = "217--223",

year = "2000",

}