On a property of n-edge-connected digraphs
From MaRDI portal
Publication:1164647
DOI10.1007/BF02579461zbMath0486.05045MaRDI QIDQ1164647
Publication date: 1981
Published in: Combinatorica (Search for Journal in Brave)
Related Items
Some generalizations of Menger's theorem concerning arc-connected digraphs ⋮ Removable edges in a 5-connected graph and a construction method of 5-connected graphs ⋮ An LP-based heuristic algorithm for the node capacitated in-tree packing problem ⋮ Paths in graphs, reducing the edge-connectivity only by two ⋮ Highly Connected Infinite Digraphs Without Edge‐Disjoint Back and Forth Paths Between a Certain Vertex Pair
Cites Work