Neighborhood and degree conditions for super-edge-connected bipartite digraphs

DOI10.1007/BF03322996zbMath1050.05075MaRDI QIDQ1885228

Lutz Volkmann, Angelika Hellwig

Publication date: 28 October 2004

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

zbMATH Keywords

degree sequenceedge connectivity

Mathematics Subject Classification ID

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

Related Items (1)

Maximally edge-connected and vertex-connected graphs and digraphs: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Super edge-connectivity of dense digraphs and graphs
• On graphs with equal edge-connectivity and minimum degree
• A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
• Results on the edge-connectivity of graphs
• Bipartite graphs and digraphs with maximum connectivity
• A sufficient condition for equality of edge-connectivity and minimum degree of a graph
• Circulants and their connectivities
• On super-edge-connected digraphs and bipartite digraphs
• Maximally connected digraphs
• Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs

This page was built for publication: Neighborhood and degree conditions for super-edge-connected bipartite digraphs