A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
From MaRDI portal
(Redirected from Publication:1336715)
Recommendations
- Sufficient conditions for maximally edge-connected graphs and arc-connected digraphs
- Sufficient conditions for equality of connectivity and minimum degree of a graph
- scientific article; zbMATH DE number 7267378
- A sufficient condition for the equality between the restricted edge-connectivity and the minimum edge-degree of graphs
- scientific article; zbMATH DE number 4208109
- scientific article; zbMATH DE number 822753
- Sufficient conditions for super-arc-connected digraphs
- Minimum degree conditions for the proper connection number of graphs
- Restricted arc-connectivity of digraphs
- On restricted arc-connectivity of regular digraphs
Cited in
(12)- Inverse degree and edge-connectivity
- Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
- scientific article; zbMATH DE number 7267378 (Why is no real title available?)
- Lower bounds on the vertex-connectivity of oriented graphs and bipartite oriented graphs
- Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
- Degree sequence conditions for maximally edge-connected oriented graphs
- scientific article; zbMATH DE number 734456 (Why is no real title available?)
- On minimum locally $n$-(arc)-strong digraphs
- Degree sequence for \(k\)-arc strongly connected multiple digraphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Local-edge-connectivity in digraphs and oriented graphs
- Neighborhood and degree conditions for super-edge-connected bipartite digraphs
This page was built for publication: A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336715)
