On Four-Connecting a Triconnected Graph
From MaRDI portal
Publication:4485192
DOI10.1006/JAGM.2000.1077zbMATH Open0951.68114OpenAlexW2029687674MaRDI QIDQ4485192FDOQ4485192
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
Recommendations
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
- Title not available (Why is that?)
- 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)
