On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
scientific article

    Statements

    On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (English)
    0 references
    0 references
    0 references
    17 December 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    (edge-)connectivity
    0 references
    Steiner tree
    0 references
    internally (edge-)disjoint trees
    0 references
    packing
    0 references
    generalized local (edge-)connectivity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references