Augmenting Outerplanar Graphs

DOI10.1006/jagm.1996.0034zbMath0857.68081OpenAlexW1969131636MaRDI QIDQ4895794

Goos Kant

Publication date: 16 October 1996

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

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

zbMATH Keywords

outerplanar graphsaugmentation problems

Mathematics Subject Classification ID

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

Related Items (24)

BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS ⋮ On triconnected and cubic plane graphs on given point sets ⋮ Augmenting the connectivity of outerplanar graphs ⋮ Triangulating planar graphs while minimizing the maximum degree ⋮ A Polynomial-Time Algorithm for Outerplanar Diameter Improvement ⋮ A polynomial-time algorithm for outerplanar diameter improvement ⋮ Angle Covers: Algorithms and Complexity ⋮ Area-efficient planar straight-line drawings of outerplanar graphs ⋮ Splitting plane graphs to outerplanarity ⋮ Augmenting the rigidity of a graph in \(\mathbb R^{2}\) ⋮ An improved algorithm for finding maximum outerplanar subgraphs ⋮ B0-VPG Representation of AT-free Outerplanar Graphs ⋮ Augmenting the edge connectivity of planar straight line graphs to three ⋮ Augmenting the connectivity of geometric graphs ⋮ Multigraph augmentation under biconnectivity and general edge-connectivity requirements ⋮ Connectivity augmentation in planar straight line graphs ⋮ The Laplacian spectral radius of graphs on surfaces ⋮ Simultaneous graph embedding with bends and circular arcs ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ 2-connecting outerplanar graphs without blowing up the pathwidth ⋮ Optimal higher order Delaunay triangulations of polygons ⋮ Augmenting the Connectivity of Planar and Geometric Graphs ⋮ Heuristics for the maximum outerplanar subgraph problem ⋮ Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)

This page was built for publication: Augmenting Outerplanar Graphs