A smallest augmentation to 3-connect a graph

DOI10.1016/0166-218X(90)90116-TzbMath0752.05036OpenAlexW1966215622MaRDI QIDQ1813979

Yanyan Li

Publication date: 25 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90116-t

zbMATH Keywords

connectivitysimple undirected graphunweighted 3-connectivity augmentation problem

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (8)

On triconnected and cubic plane graphs on given point sets ⋮ Augmenting the connectivity of outerplanar graphs ⋮ An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach ⋮ Augmenting the rigidity of a graph in \(\mathbb R^{2}\) ⋮ Augmenting the connectivity of geometric graphs ⋮ A minimum 3-connectivity augmentation of a graph ⋮ On the minor-minimal 2-connected graphs having a fixed minor ⋮ Algorithm and complexity of the two disjoint connected dominating sets problem on trees

Cites Work

• Unnamed Item
• Edge-connectivity augmentation problems
• A minimum 3-connectivity augmentation of a graph
• Approximation Algorithms for Several Graph Augmentation Problems
• Augmentation Problems
• Smallest Augmentations to Biconnect a Graph
• Dividing a Graph into Triconnected Components

This page was built for publication: A smallest augmentation to 3-connect a graph