Augmenting Outerplanar Graphs
From MaRDI portal
Recommendations
Cited in
(27)- Optimal higher order Delaunay triangulations of polygons
- Triangulating planar graphs while minimizing the maximum degree
- Augmenting a tree to a k-arbor-connected graph with pagenumber k
- A polynomial-time algorithm for outerplanar diameter improvement
- The Laplacian spectral radius of graphs on surfaces
- Heuristics for the maximum outerplanar subgraph problem
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements
- Augmenting outerplanar graphs to meet diameter requirements
- Bounded length, 2-edge augmentation of geometric planar graphs
- A polynomial-time algorithm for outerplanar diameter improvement
- scientific article; zbMATH DE number 1303565 (Why is no real title available?)
- Angle covers: algorithms and complexity
- Augmenting the connectivity of planar and geometric graphs
- Splitting plane graphs to outerplanarity
- An improved algorithm for finding maximum outerplanar subgraphs
- B0-VPG Representation of AT-free Outerplanar Graphs
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- Augmenting the edge connectivity of planar straight line graphs to three
- Connectivity augmentation in planar straight line graphs
- Splitting plane graphs to outerplanarity
- Graph connectivity and its augmentation: Applications of MA orderings
- 2-connecting outerplanar graphs without blowing up the pathwidth
- On triconnected and cubic plane graphs on given point sets
- Augmenting the connectivity of outerplanar graphs
- Area-efficient planar straight-line drawings of outerplanar graphs
- Augmenting the connectivity of geometric graphs
- Simultaneous graph embedding with bends and circular arcs
This page was built for publication: Augmenting Outerplanar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895794)
