Sufficient degree conditions for<i>k</i>-edge-connectedness of a graph (Q3057109)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Sufficient degree conditions for<i>k</i>-edge-connectedness of a graph
scientific article

    Statements

    Sufficient degree conditions for<i>k</i>-edge-connectedness of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2010
    0 references
    0 references
    strongest monotone condition
    0 references
    edge-connectivity
    0 references
    degree sequence
    0 references
    weakly optimal
    0 references
    0 references