Edge-connectivity augmentation of simple graphs

DOI10.1137/23M1574245MaRDI QIDQ6668353zbMATH OpenFDO

Authors Kasper Skov Johansen, Eva Rotenberg, Carsten Thomassen

Publication date 22 January 2025

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/23M1574245

zbMATH Keywords

edge-connectivitygraph augmentationmatchings

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Edge-Connectivity Augmentation Preserving Simplicity
• Edge-connectivity augmentation problems
• On the maximum size of a minimal \(k\)-edge connected augmentation
• Edge-augmentation of hypergraphs
• Connectivity augmentation of graphs

Cites work

• A Reduction Method for Edge-Connectivity in Graphs
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Edge-Connectivity Augmentation Preserving Simplicity

This page was built for publication: Edge-connectivity augmentation of simple graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6668353)