On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs
From MaRDI portal
Publication:2118230
Recommendations
Cites work
- 3-restricted arc connectivity of digraphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On the restricted arc-connectivity of \(s\)-geodetic digraphs
- On the super-restricted arc-connectivity of \(s\)-geodetic digraphs
- Restricted arc-connectivity in tournaments
- Restricted arc-connectivity of bipartite tournaments
- Restricted arc-connectivity of digraphs
- Restricted arc-connectivity of generalized \(p\)-cycles
- Restricted connectivity of total digraph
- Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
- The restricted arc connectivity of Cartesian product digraphs
- \(\lambda ^{\prime}\)-optimal digraphs
- \(\lambda^{\prime}\)-optimality of bipartite digraphs
Cited in
(10)- \(\lambda ^{\prime}\)-optimal digraphs
- Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
- Restricted connectivity of total digraph
- Cartesian product digraphs with optimal restricted arc connectivity
- On the connectivity and restricted edge-connectivity of 3-arc graphs
- Restricted arc-connectivity of bipartite tournaments
- Restricted arc-connectivity of digraphs.
- 3-restricted arc connectivity of digraphs
- \(\lambda^{\prime}\)-optimality of bipartite digraphs
- Restricted connectivity of line digraphs
This page was built for publication: On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118230)