Small universal point sets for \(k\)-outerplanar graphs
From MaRDI portal
Publication:1991093
DOI10.1007/s00454-018-0009-xzbMath1398.05068OpenAlexW2807135142WikidataQ59410422 ScholiaQ59410422MaRDI QIDQ1991093
Tamara Mchedlidze, Patrizio Angelini, Michael Kaufmann, Giuseppe Di Battista, Vincenzo Roselli, Claudio Squarcella, Till Bruckdorfer
Publication date: 30 October 2018
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-018-0009-x
Related Items (2)
Planar drawings with few slopes of Halin graphs and nested pseudotrees ⋮ A Note on Universal Point Sets for Planar Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On point-sets that support planar graphs
- 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
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- Finding Hamiltonian cycles in certain planar graphs
- Upward straight-line embeddings of directed graphs into point sets
- Embedding planar graphs in four pages
- On embedding an outer-planar graph in a point set
- Universal point sets for planar three-trees
- A Universal Point Set for 2-Outerplanar Graphs
- Linear-Size Universal Point Sets for One-Bend Drawings
- Small Point Sets for Simply-Nested Planar Graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- Universal Point Subsets for Planar Graphs
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
- Superpatterns and Universal Point Sets
- On Universal Point Sets for Planar Graphs
- The Utility of Untangling
This page was built for publication: Small universal point sets for \(k\)-outerplanar graphs
