Completely independent spanning trees in some regular graphs.

Benoît Darties Nicolas Gastineau Olivier Togni

Published in: Discret. Appl. Math. (2017)

Keyphrases

spanning tree
completely independent
minimum spanning tree
minimum spanning trees
edge disjoint
minimum cost
undirected graph
minimum weight
weighted graph
depth first search
edge weights
finite state
minimum total cost
multimedia
np hard