Upper Bound Constructions for Untangling Planar Geometric Graphs (Q3223962): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-25878-7_28
+Normal rank
@@ Property / OpenAlex ID @@
+W2274559613
@@ Property / OpenAlex ID: W2274559613 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial bound for untangling geometric planar graphs
+Normal rank
@@ Property / cites work @@
+Untangling polygons and graphs
@@ Property / cites work: Untangling polygons and graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5759552
@@ Property / cites work: Q5759552 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5786239
@@ Property / cites work: Q5786239 / rank @@
+Normal rank
@@ Property / cites work @@
+Untangling a planar graph
@@ Property / cites work: Untangling a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
+Normal rank
@@ Property / cites work @@
+Untangling planar graphs from a specified vertex position-Hard cases
+Normal rank
@@ Property / cites work @@
+Untangling a polygon
@@ Property / cites work: Untangling a polygon / rank @@
+Normal rank
@@ Property / cites work @@
+On Hamiltonian Circuits
@@ Property / cites work: On Hamiltonian Circuits / rank @@
+Normal rank