Highly Connected Infinite Digraphs Without Edge-Disjoint Back and Forth Paths Between a Certain Vertex Pair.

Published in: J. Graph Theory (2017)

Keyphrases

undirected graph
spanning tree
disjoint paths
highly connected
edge disjoint
directed graph
minimum spanning tree
minimum cost
total length
pairwise
random walk
edge weights
equivalence classes
special case
text mining
weighted graph