Abstract
Let G be a connected graph and S c V (G) with | S | > 2. A tree T in G is called an S-tree if S c V(T). Two S-trees T1 and T2 are internally disjoi......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
