Some generalizations of Menger's theorem concerning arc-connected digraphs

DOI10.1016/S0012-365X(96)00129-XzbMath0890.05043OpenAlexW2053306596MaRDI QIDQ1377773

Xiang-Ying Su

Publication date: 29 June 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00129-x

zbMATH Keywords

digraphconnectivityMenger's theorem

Mathematics Subject Classification ID

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

Cites Work

• On a property of n-edge-connected digraphs
• A good algorithm for edge-disjoint branching
• Edge-disjoint branching in directed multigraphs
• Paths, cycles, and arc‐connectivity in digraphs

This page was built for publication: Some generalizations of Menger's theorem concerning arc-connected digraphs