A tight bound on the collection of edges in MSTs of induced subgraphs (Q1003845)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A tight bound on the collection of edges in MSTs of induced subgraphs
scientific article

    Statements

    A tight bound on the collection of edges in MSTs of induced subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    4 March 2009
    0 references
    minimum spanning tree
    0 references
    MST
    0 references
    vertex connectivity
    0 references
    Mader's theorem
    0 references
    Menger's theorem
    0 references
    minimal \(k\)-connected graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references