Completely independent spanning trees in (partial) k-trees
Toru Araki, Masayoshi Matsushita, Yota Otachi · Discussiones Mathematicae Graph Theory · 2015
Two spanning trees T 1 and T 2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T 1 and T 2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree.