Two counterexamples on completely independent spanning trees.

Ferenc Péterfalvi

Published in: Discret. Math. (2012)

Keyphrases

completely independent
spanning tree
edge disjoint
minimum spanning tree
minimum cost
minimum spanning trees
finite state
undirected graph
root node
weighted graph
minimum total cost
np hard
edge weights
total length