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

DOI10.1007/BF03322996MaRDI QIDQ1885228zbMATH OpenFDO

Authors Angelika Hellwig, Lutz Volkmann

Publication date 28 October 2004

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

Full work available at URL https://doi.org/10.1007/BF03322996

zbMATH Keywords

degree sequenceedge connectivity

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2191995
• Super edge-connectivity of dense digraphs and graphs
• scientific article; zbMATH DE number 5575580
• On super-edge-connected digraphs and bipartite digraphs
• Sufficient conditions for digraphs to be maximally connected and super-connected

Cites work

• A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
• A sufficient condition for equality of edge-connectivity and minimum degree of a graph
• Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
• Bipartite graphs and digraphs with maximum connectivity
• Circulants and their connectivities
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 1062587 (Why is no real title available?)
• scientific article; zbMATH DE number 2114675 (Why is no real title available?)
• scientific article; zbMATH DE number 822753 (Why is no real title available?)
• scientific article; zbMATH DE number 2191995 (Why is no real title available?)
• Maximally connected digraphs
• On graphs with equal edge-connectivity and minimum degree
• On super-edge-connected digraphs and bipartite digraphs
• Results on the edge-connectivity of graphs
• Super edge-connectivity of dense digraphs and graphs
• Super-edge-connectivity properties of graphs with diameter 2

Cited in

(6)

• Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
• Super edge-connectivity of dense digraphs and graphs
• Sufficient conditions for bipartite graphs to be super restricted edge-connected
• On super-edge-connected digraphs and bipartite digraphs
• scientific article; zbMATH DE number 2191995 (Why is no real title available?)
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885228)