Degree sequence conditions for maximally edge-connected oriented graphs

DOI10.1016/J.AML.2006.01.011zbMath1172.05323OpenAlexW2073109155MaRDI QIDQ1031725

Lutz Volkmann

Publication date: 30 October 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2006.01.011

zbMATH Keywords

oriented graphedge-connectivitydegree sequenceoriented bipartite graph

Mathematics Subject Classification ID

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

Related Items (2)

On the edge-connectivity of C_4-free graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey

Cites Work

• Degree realization of undirected graphs in reduced form
• A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
• Bipartite graphs and digraphs with maximum connectivity
• Connectivity of Regular Directed Graphs with Small Diameters
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Degree sequence conditions for maximally edge-connected oriented graphs