Small Point Sets for Simply-Nested Planar Graphs
From MaRDI portal
Publication:3223945
DOI10.1007/978-3-642-25878-7_8zbMath1311.68098OpenAlexW1586090198MaRDI QIDQ3223945
Tamara Mchedlidze, Michael Kaufmann, Vincenzo Roselli, Patrizio Angelini, Giuseppe Di Battista, Claudio Squarcella
Publication date: 9 March 2012
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_8
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (4)
Planar drawings with few slopes of Halin graphs and nested pseudotrees ⋮ Outerspatial 2-complexes: extending the class of outerplanar graphs to three dimensions ⋮ Small universal point sets for \(k\)-outerplanar graphs ⋮ Universal point sets for planar three-trees
Cites Work
- 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
- Finding Hamiltonian cycles in certain planar graphs
- Embedding planar graphs in four pages
- Minimum-width grid drawings of plane graphs
- On embedding an outer-planar graph in a point set
- Radial Level Planarity Testing and Embedding in Linear Time
- Approximation algorithms for NP-complete problems on planar graphs
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
This page was built for publication: Small Point Sets for Simply-Nested Planar Graphs