Title of article
Degree sequence conditions for maximally edge-connected graphs depending on the clique number
Author/Authors
Peter Dankelmann، نويسنده , , Lutz Volkmann، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
7
From page
217
To page
223
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.
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950297
Link To Document