Small point sets for simply-nested planar graphs

DOI10.1007/978-3-642-25878-7_8MaRDI QIDQ3223945zbMATH OpenOpenAlexFDO

Authors Patrizio Angelini, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, 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

Mathematics Subject Classification ID

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)

Recommendations

• Small universal point sets for \(k\)-outerplanar graphs
• Universal point subsets for planar graphs
• On universal point sets for planar graphs
• On universal point sets for planar graphs
• A universal point set for 2-outerplanar graphs

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
• Approximation algorithms for NP-complete problems on planar graphs
• Embedding planar graphs in four pages
• Finding Hamiltonian cycles in certain planar graphs
• How to draw a planar graph on a grid
• Minimum-width grid drawings of plane graphs
• On embedding an outer-planar graph in a point set
• Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
• Radial Level Planarity Testing and Embedding in Linear Time

Cited in

(11)

• Planar drawings with few slopes of Halin graphs and nested pseudotrees
• Universal point sets for planar three-trees
• Planar drawings with few slopes of Halin graphs and nested pseudotrees
• Small universal point sets for \(k\)-outerplanar graphs
• Universal point subsets for planar graphs
• A universal point set for 2-outerplanar graphs
• On universal point sets for planar graphs
• On universal point sets for planar graphs
• Nesting points in the sphere
• EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION
• Outerspatial 2-complexes: extending the class of outerplanar graphs to three dimensions

This page was built for publication: Small point sets for simply-nested planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3223945)