id: 05810777
dt: j
an: 05810777
au: Kriesell, Matthias
ti: Packing Steiner trees on four terminals.
so: J. Comb. Theory, Ser. B 100, No. 6, 546-553 (2010).
py: 2010
pu: Elsevier Science (Academic Press), San Diego, CA
la: EN
cc: 
ut: Steiner tree packing; edge-connectivity; bridge; binary tree
ci: 
li: doi:10.1016/j.jctb.2010.04.003
ab: Summary: Let $A$ be a set of vertices of some graph $G$. An $A$-tree is a
    subtree of $G$ containing $A$, and $A$ is called $k$-edge-connected in
    $G$ if every set of less than $k$ edges in $G$ misses at least one
    $A$-tree. We prove that every $\lceil \frac{3k}2 \rceil$-edge-connected
    set $A$ of four vertices in a graph admits a set of $k$ edge disjoint
    $A$-trees. The bound $\lceil \frac{3k}2 \rceil$ is best possible for
    all $k>1$.
rv: