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

DOI10.1002/jgt.22046zbMath1365.05159arXiv1705.00479OpenAlexW3124034694MaRDI QIDQ5272632

Attila Joó

Publication date: 30 June 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.00479

zbMATH Keywords

counterexampleinfinite graphedge-connectivityself similar

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Infinite graphs (05C63)

Related Items (1)

Packing Countably Many Branchings with Prescribed Root‐Sets in Infinite Digraphs

Cites Work

• On a property of n-edge-connected digraphs
• Infinite, highly connected digraphs with no two arc-disjoint spanning trees

This page was built for publication: Highly Connected Infinite Digraphs Without Edge‐Disjoint Back and Forth Paths Between a Certain Vertex Pair