On triangulating \(k\)-outerplanar graphs (Q479051): Difference between revisions

@@ Property / arXiv ID @@
+.1845
@@ Property / arXiv ID: 1310.1845 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+On triangulating planar graphs under the four-connectivity constraint
+Normal rank
@@ Property / cites work @@
+Drawing planar 3-trees with given face areas
@@ Property / cites work: Drawing planar 3-trees with given face areas / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Subgraph Isomorphism in Planar Graphs and Related Problems
+Normal rank
@@ Property / cites work @@
+Triangulating planar graphs while minimizing the maximum degree
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216652
@@ Property / cites work: Q3216652 / rank @@
+Normal rank