Triangulating planar graphs while minimizing the maximum degree
From MaRDI portal
Recommendations
Cites work
- A Fast Algorithm for Optimally Increasing the Edge Connectivity
- A minimum 3-connectivity augmentation of a graph
- Algorithms for drawing graphs: An annotated bibliography
- Angles of planar triangular graphs
- Augmentation Problems
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmenting Outerplanar Graphs
- Circle packings of maps in polynomial time
- Drawing planar graphs using the canonical ordering
- Edge-connectivity augmentation problems
- How to draw a planar graph on a grid
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 4006289 (Why is no real title available?)
- scientific article; zbMATH DE number 1256642 (Why is no real title available?)
- On the Angular Resolution of Planar Graphs
- On triangulating planar graphs under the four-connectivity constraint
- One strike against the min-max degree triangulation problem
- Smallest Augmentations to Biconnect a Graph
- Some simplified NP-complete graph problems
Cited in
(23)- A force-directed algorithm that preserves edge-crossing properties
- Higher order Delaunay triangulations
- Embedding-preserving rectangle visibility representations of nonplanar graphs
- A new algorithm for embedding plane graphs at fixed vertex locations
- Counting polygon triangulations is hard
- Optimization for first order Delaunay triangulations
- Universal slope sets for 1-bend planar drawings
- Dual circumference and collinear sets
- Triangulating planar graphs while keeping the pathwidth small
- scientific article; zbMATH DE number 5525873 (Why is no real title available?)
- scientific article; zbMATH DE number 1953077 (Why is no real title available?)
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- On triangulating \(k\)-outerplanar graphs
- scientific article; zbMATH DE number 1866931 (Why is no real title available?)
- On partitioning the edges of 1-plane graphs
- Triangulating planar graphs while minimizing the maximum degree
- On triangulating planar graphs under the four-connectivity constraint
- The stub resolution of 1-planar graphs
- Dual circumference and collinear sets
- scientific article; zbMATH DE number 7559233 (Why is no real title available?)
- One strike against the min-max degree triangulation problem
- Recognition complexity of subgraphs of \({\mathbf{k}}\)-connected planar cubic graphs
- Efficient recognition of subgraphs of planar cubic bridgeless graphs
This page was built for publication: Triangulating planar graphs while minimizing the maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363779)
