Sufficient conditions for maximally edge-connected and super-edge-connected digraphs depending on the size

DOI10.1007/s10114-019-8448-8zbMath1431.05092OpenAlexW2991527231MaRDI QIDQ2287762

Lutz Volkmann, Sebastian Milz

Publication date: 21 January 2020

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-019-8448-8

zbMATH Keywords

digraphsedge-connectivitymaximally edge-connected digraphssuper-edge-connected digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number
• Sufficient conditions for maximally edge-connected and super-edge-connected graphs
• A Graph-Theoretic Approach to a Communications Problem

This page was built for publication: Sufficient conditions for maximally edge-connected and super-edge-connected digraphs depending on the size