The constructive characterization of \((k,l)\)-edge-connected digraphs

DOI10.1007/s00493-011-2570-2zbMath1249.05327OpenAlexW2095490851MaRDI QIDQ653995

László A. Végh, Erika R. Bérczi-Kovács

Publication date: 20 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.722.8360

zbMATH Keywords

\((k,l)\)-edge-connected digraphsedge pinching

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• On the orientation of graphs
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• Constructive characterizations for packing and covering with trees
• Graph orientations with edge-connection and parity constraints
• On the Problem of Decomposing a Graph into n Connected Factors