A Note on Universal Point Sets for Planar Graphs
From MaRDI portal
Publication:5119378
DOI10.7155/jgaa.00529zbMath1447.05065arXiv1811.06482OpenAlexW3019053352MaRDI QIDQ5119378
Manfred Scheucher, Raphael Steiner, Hendrik Schrezenmaier
Publication date: 4 September 2020
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.06482
Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Proximity in triangulations and quadrangulations ⋮ An exponential bound for simultaneous embeddings of planar graphs ⋮ Topological Drawings Meet Classical Theorems from Convex Geometry
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- How to draw a planar graph on a grid
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- On simultaneous planar graph embeddings
- Abstract order type extension and new results on the rectilinear crossing number
- Enumerating order types for small point sets with applications
- Small universal point sets for \(k\)-outerplanar graphs
- A note on universal point sets for planar graphs
- Universal point sets for planar three-trees
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- Practical graph isomorphism. II.
- Point-Set Embeddings of Plane 3-Trees
- Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees
- Drawing Planar Graphs on Area
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- Theory and Applications of Satisfiability Testing
- Superpatterns and Universal Point Sets
- On Universal Point Sets for Planar Graphs
- Sweeps, arrangements and signotopes
This page was built for publication: A Note on Universal Point Sets for Planar Graphs
