On a property of n-edge-connected digraphs

DOI10.1007/BF02579461zbMath0486.05045MaRDI QIDQ1164647

W. Mader

Publication date: 1981

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

edge connectivity

Mathematics Subject Classification ID

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

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

• Edge-disjoint branching in directed multigraphs
• Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen