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

From MaRDI portal
Revision as of 22:48, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Degree sequence conditions for maximally edge-connected graphs depending on the clique number
scientific article

    Statements

    Degree sequence conditions for maximally edge-connected graphs depending on the clique number (English)
    0 references
    0 references
    0 references
    30 July 2000
    0 references
    In their previous papers the authors gave sufficient degree conditions for the equality of edge-connectivity and minimum degree of a general graph [see J. Graph Theory 26, No. 1, 27-34 (1997; Zbl 0879.05049)] or a graph with given clique number [see Ars Comb. 40, 270-278 (1995; Zbl 0839.05065)]. In this paper generalizations of these results are proved. In some sense the results are best possible.
    0 references
    0 references
    graph
    0 references
    degree sequence
    0 references
    edge-connectivity
    0 references
    minimum degree
    0 references
    clique number
    0 references

    Identifiers