Constructing disjoint Steiner trees in Sierpiński graphs

Chenxu Yang, Ping Li, Yaping Mao +2

Let $G$ be a graph and $S\subseteq V(G)$ with $|S|\ge 2$. Then the trees $T_1,T_2,\cdots ,T_{\ell }$ in $G$ are \emph{internally disjoint Steiner trees} connecting $S$ (or $S$-Stei…