scientific article; zbMATH DE number 1303025
From MaRDI portal
Publication:4249524
Recommendations
- Augmenting a \((k-1)\)-vertex-connected multigraph to an \(\ell\)-edge-connected and \(k\)-vertex-connected multigraph
- Edge-connectivity augmentations of~graphs~and~hypergraphs
- Publication:4938784
- Optimal augmentation of a 2-vertex-connected multigraph to an -edge-connected and 3-vertex-connected multigraph
- scientific article; zbMATH DE number 1303567
- scientific article; zbMATH DE number 1372654
- Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
- Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
- A minimum 3-connectivity augmentation of a graph
- Augmenting edge-connectivity between vertex subsets
Cited in
(10)- 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
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
- scientific article; zbMATH DE number 1303567 (Why is no real title available?)
- scientific article; zbMATH DE number 1104329 (Why is no real title available?)
- scientific article; zbMATH DE number 1555937 (Why is no real title available?)
- scientific article; zbMATH DE number 1372654 (Why is no real title available?)
- scientific article; zbMATH DE number 1405799 (Why is no real title available?)
- Graph connectivity and its augmentation: Applications of MA orderings
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
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 Q4249524)