A sharp upper bound for the number of stable sets in graphs with given number of cut edges (Q1033025)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A sharp upper bound for the number of stable sets in graphs with given number of cut edges
scientific article

    Statements

    A sharp upper bound for the number of stable sets in graphs with given number of cut edges (English)
    0 references
    6 November 2009
    0 references
    stable set
    0 references
    cut edge
    0 references
    2-edge-connected graph
    0 references
    upper bound
    0 references
    extremal graph
    0 references
    0 references

    Identifiers