Minimally \(k\)-edge-connected directed graphs of maximal size

DOI10.1007/S00373-004-0588-6zbMath1062.05079OpenAlexW2054440703MaRDI QIDQ1777235

Alex R. Berg, Tibor Jordán

Publication date: 12 May 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0588-6

zbMATH Keywords

Edge-connectivityDirected graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (1)

Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs

This page was built for publication: Minimally \(k\)-edge-connected directed graphs of maximal size