Infinite, highly connected digraphs with no two arc-disjoint spanning trees.

Ron Aharoni Carsten Thomassen

Published in: J. Graph Theory (1989)

Keyphrases

spanning tree
highly connected
undirected graph
edge disjoint
minimum spanning tree
minimum cost
pairwise
minimum spanning trees
equivalence classes
weighted graph
minimum total cost
directed graph
special case
data objects