Publication:4355069

DOI<27::AID-JGT4>3.0.CO;2-J 10.1002/(SICI)1097-0118(199709)26:1<27::AID-JGT4>3.0.CO;2-JzbMath0879.05049MaRDI QIDQ4355069

Peter Dankelmann, Lutz Volkmann

Publication date: 22 December 1997

zbMATH Keywords

bipartite; graph; digraph; minimum degree; edge-connectivity; degree sequence

Mathematics Subject Classification ID

05C20: Directed graphs (digraphs), tournaments

05C40: Connectivity

Related Items

Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth, Super Edge-Connected Linear Hypergraphs, On the edge-connectivity of C_4-free graphs, Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\), On optimizing edge connectivity of product graphs, Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, Degree sequence conditions for maximally edge-connected oriented graphs, Inverse degree and edge-connectivity, Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\), Neighborhood and degree conditions for super-edge-connected bipartite digraphs, Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs, Super edge-connectivity and zeroth-order Randić index, Super-edge-connectivity and zeroth-order Randić index, Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\), Sufficient conditions for restricted-edge-connectivity to be optimal, Local-edge-connectivity in digraphs and oriented graphs