Small universal point sets for \(k\)-outerplanar graphs (Q1991093): Difference between revisions

@@ Property / cites work @@
+Small Point Sets for Simply-Nested Planar Graphs
@@ Property / cites work: Small Point Sets for Simply-Nested Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Universal Point Subsets for Planar Graphs
@@ Property / cites work: Universal Point Subsets for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Universal Point Set for 2-Outerplanar Graphs
@@ Property / cites work: A Universal Point Set for 2-Outerplanar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Superpatterns and Universal Point Sets
@@ Property / cites work: Superpatterns and Universal Point Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Upward straight-line embeddings of directed graphs into point sets
+Normal rank
@@ Property / cites work @@
+On embedding an outer-planar graph in a point set
@@ Property / cites work: On embedding an outer-planar graph in a point set / rank @@
+Normal rank
@@ Property / cites work @@
+Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
+Normal rank
@@ Property / cites work @@
+On Universal Point Sets for Planar Graphs
@@ Property / cites work: On Universal Point Sets for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian cycles in certain planar graphs
+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 @@
+The Utility of Untangling
@@ Property / cites work: The Utility of Untangling / rank @@
+Normal rank
@@ Property / cites work @@
+On point-sets that support planar graphs
@@ Property / cites work: On point-sets that support planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
+Normal rank
@@ Property / cites work @@
+Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
+Normal rank
@@ Property / cites work @@
+Universal point sets for planar three-trees
@@ Property / cites work: Universal point sets for planar three-trees / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
+Normal rank
@@ Property / cites work @@
+A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
+Normal rank
@@ Property / cites work @@
+Linear-Size Universal Point Sets for One-Bend Drawings
+Normal rank
@@ Property / cites work @@
+Q3138887
@@ Property / cites work: Q3138887 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3322145
@@ Property / cites work: Q3322145 / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding planar graphs in four pages
@@ Property / cites work: Embedding planar graphs in four pages / rank @@
+Normal rank