On Four-Connecting a Triconnected Graph

DOI10.1006/jagm.2000.1077zbMath0951.68114OpenAlexW2029687674MaRDI QIDQ4485192

Tsan-sheng Hsu

Publication date: 5 June 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1077

zbMATH Keywords

triconnected graphsmallest augmentation problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

Smallest bipartite bridge-connectivity augmentation ⋮ An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach ⋮ On the cycle augmentation problem: hardness and approximation algorithms ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ Independence free graphs and vertex connectivity augmentation ⋮ The bridge-connectivity augmentation problem with a partition constraint ⋮ A UNIFIED FRAMEWORK FOR BI(TRI)CONNECTIVITY AND CHORDAL AUGMENTATION ⋮ Algorithm and complexity of the two disjoint connected dominating sets problem on trees

This page was built for publication: On Four-Connecting a Triconnected Graph