scientific article; zbMATH DE number 1303567
From MaRDI portal
Publication:4250193
Recommendations
- Optimal augmentation of a 2-vertex-connected multigraph to an -edge-connected and 3-vertex-connected multigraph
- Augmenting a \((k-1)\)-vertex-connected multigraph to an \(\ell\)-edge-connected and \(k\)-vertex-connected multigraph
- k-edge and 3-vertex connectivity augmentation in an arbitrary multigraph
- Simultaneous augmentation of two graphs to an -edge-connected graph and a biconnected graph
Cited in
(11)- How to make a graph four-connected
- Polyhedral structure of submodular and posi-modular systems
- Optimal augmentation of a 2-vertex-connected multigraph to an -edge-connected and 3-vertex-connected multigraph
- On the minimum augmentation of an -connected graph to a k-connected graph
- scientific article; zbMATH DE number 4128844 (Why is no real title available?)
- Edge-Connectivity Augmentation Preserving Simplicity
- scientific article; zbMATH DE number 1263261 (Why is no real title available?)
- k-edge and 3-vertex connectivity augmentation in an arbitrary multigraph
- Simultaneous augmentation of two graphs to an -edge-connected graph and a biconnected graph
- Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph
- Graph connectivity and its augmentation: Applications of MA orderings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250193)