Bounds on the maximum number of edge-disjoint Steiner trees of a graph
Let \(G\) be a connected graph and let \(K\) be a set of vertices of \(G\) with \(|K|\geq 2\). The paper discusses the problem to estimate the number of edge-disjoint Steiner trees on the set \(K\) in \(G\). It gives bounds of this number in terms of the edge-toughness and the edge-connectivity of \(G\).
scientific article; zbMATH DE number 1599135