Edge-connectivity augmentation of simple graphs

DOI10.1137/23m1574245MaRDI QIDQ6668353

Eva Rotenberg, Carsten Thomassen, Kasper Skov Johansen

Publication date: 22 January 2025

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

zbMATH Keywords

matchingsedge-connectivitygraph augmentation

Mathematics Subject Classification ID

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

Cites Work

• Augmenting Graphs to Meet Edge-Connectivity Requirements
• A Reduction Method for Edge-Connectivity in Graphs
• 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)