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

Attila JoĆ³. Highly Connected Infinite Digraphs Without Edge-Disjoint Back and Forth Paths Between a Certain Vertex Pair. Journal of Graph Theory, 85(1):51-55, 2017. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.