Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices (Q848671): Difference between revisions

@@ Property / author @@
+Stephen K. Wismath
@@ Property / author: Stephen K. Wismath / rank @@
+Normal rank
@@ 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/s00454-009-9149-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2058678665
@@ Property / OpenAlex ID: W2058678665 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59410429
@@ Property / Wikidata QID: Q59410429 / rank @@
+Normal rank
@@ Property / cites work @@
+The book thickness of a graph
@@ Property / cites work: The book thickness of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On simultaneous planar graph embeddings
@@ Property / cites work: On simultaneous planar graph embeddings / rank @@
+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 @@
+Curve-constrained drawings of planar graphs
@@ Property / cites work: Curve-constrained drawings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
+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 @@
+Embedding planar graphs at fixed vertex locations
@@ Property / cites work: Embedding planar graphs at fixed vertex locations / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138887
@@ Property / cites work: Q3138887 / rank @@
+Normal rank