Triangulating planar graphs while minimizing the maximum degree (Q1363779): Difference between revisions

@@ Property / cites work @@
+On triangulating planar graphs under the four-connectivity constraint
+Normal rank
@@ Property / cites work @@
+Algorithms for drawing graphs: An annotated bibliography
+Normal rank
@@ Property / cites work @@
+Angles of planar triangular graphs
@@ Property / cites work: Angles of planar triangular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230328
@@ Property / cites work: Q4230328 / rank @@
+Normal rank
@@ Property / cites work @@
+One strike against the min-max degree triangulation problem
+Normal rank
@@ Property / cites work @@
+Drawing planar graphs using the canonical ordering
+Normal rank
@@ Property / cites work @@
+Augmenting Outerplanar Graphs
@@ Property / cites work: Augmenting Outerplanar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Angular Resolution of Planar Graphs
@@ Property / cites work: On the Angular Resolution of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Circle packings of maps in polynomial time
@@ Property / cites work: Circle packings of maps in polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Algorithm for Optimally Increasing the Edge Connectivity
+Normal rank
@@ Property / cites work @@
+Q3757930
@@ Property / cites work: Q3757930 / rank @@
+Normal rank
@@ Property / cites work @@
+Smallest Augmentations to Biconnect a Graph
@@ Property / cites work: Smallest Augmentations to Biconnect a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138887
@@ Property / cites work: Q3138887 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-connectivity augmentation problems
@@ Property / cites work: Edge-connectivity augmentation problems / rank @@
+Normal rank
@@ Property / cites work @@
+A minimum 3-connectivity augmentation of a graph
@@ Property / cites work: A minimum 3-connectivity augmentation of a graph / rank @@
+Normal rank