Augmenting the Connectivity of Planar and Geometric Graphs
From MaRDI portal
Publication:3143755
DOI10.7155/jgaa.00275zbMath1254.05088OpenAlexW2011374244MaRDI QIDQ3143755
Publication date: 4 December 2012
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00275
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Fast Algorithms for Diameter-Optimally Augmenting Paths ⋮ Plane augmentation of plane graphs to meet parity constraints ⋮ Compatible connectivity augmentation of planar disconnected graphs ⋮ Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs ⋮ Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees ⋮ Minimum weight connectivity augmentation for planar straight-line graphs ⋮ Regular augmentation of planar graphs ⋮ Geometric biplane graphs. I: Maximal graphs ⋮ Geometric biplane graphs. II: Graph augmentation ⋮ Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
