Edge-disjoint trees containing some given vertices in a graph
From MaRDI portal
Publication:1405100
DOI10.1016/S0095-8956(02)00013-8zbMath1027.05023MaRDI QIDQ1405100
Publication date: 25 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
05C05: Trees
Related Items
Packing Steiner trees on four terminals, Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs, Hardness and approximation results for packing Steiner trees, Packing Steiner trees with identical terminal sets, Packing the Steiner trees of a graph, Edge disjoint Steiner trees in graphs without large bridges
Cites Work