On N–Edge–Connected Digraphs

DOI10.1016/S0304-0208(08)73419-4zbMath0525.05032OpenAlexW1554076529MaRDI QIDQ3039383

W. Mader

Publication date: 1983

Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73419-4

zbMATH Keywords

edge-connectivityedge-disjoint branchings

Mathematics Subject Classification ID

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

Related Items (1)

Packing algorithms for arborescences (and spanning trees) in capacitated graphs

This page was built for publication: On N–Edge–Connected Digraphs