On Four-Connecting a Triconnected Graph

DOI10.1006/JAGM.2000.1077MaRDI QIDQ4485192zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1256642
• scientific article; zbMATH DE number 1263261
• Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract)

Cited in

(17)

• An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
• Smallest bipartite bridge-connectivity augmentation
• A unified framework for bi(tri)connectivity and chordal augmentation
• Improved algorithms for graph four-connectivity
• Maintaining the classes of 4-edge-connectivity in a graph on-line
• The bridge-connectivity augmentation problem with a partition constraint
• THE EXISTENCE CONDITION OF A 4-CONNECTED GRAPH WITH SPECIFIED CONFIGURATIONS
• Independence free graphs and vertex connectivity augmentation
• 4-connected triangulations and 4-orderedness
• \(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs
• On triangulating planar graphs under the four-connectivity constraint
• Graph connectivity and its augmentation: Applications of MA orderings
• The graph of triangulations of a point configuration with \(d+4\) vertices is 3-connected
• scientific article; zbMATH DE number 512928 (Why is no real title available?)
• On hypergraphs with every four points spanning at most two triples
• Algorithm and complexity of the two disjoint connected dominating sets problem on trees
• On the cycle augmentation problem: hardness and approximation algorithms

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

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