Blar i Department of Informatics på emneord "completely independent spanning trees"
Viser treff 1-1 av 1
-
Connecting Vertices by Independent Trees
(Journal article; Peer reviewed, 2014)We study the paramereteized complexity of the following connectivity problem. For a vertex subset U of a graph G, trees T1, . . . , Ts of G are completely independent spanning trees of U if each of them contains U , and ...