Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number

DOI10.1016/j.disc.2017.09.015zbMath1376.05065OpenAlexW2762592557MaRDI QIDQ1686003

Sebastian Milz, Lutz Volkmann

Publication date: 20 December 2017

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

Full work available at URL: https://doi.org/10.1016/j.disc.2017.09.015

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Inverse degree and edge-connectivity
• On super-edge-connected digraphs and bipartite digraphs
• Edge‐connectivity in p‐partite graphs
• Unnamed Item
• Unnamed Item