Universal point sets for planar three-trees

DOI10.1016/J.JDA.2014.12.005MaRDI QIDQ2253908zbMATH OpenOpenAlexFDO

Authors Radoslav Fulek, Csaba D. Tóth

Publication date 13 February 2015

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2014.12.005

zbMATH Keywords

graph embeddinguniversal point setplanar three-tree

Mathematics Subject Classification ID

Trees (05C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Universal point sets for planar three-trees
• Universal line-sets for drawing planar 3-trees
• Universal line-sets for drawing planar 3-trees
• Point-set embeddings of plane 3-trees
• On universal point sets for planar graphs
• On universal point sets for planar graphs
• Point-set embeddings of plane 3-trees (extended abstract)
• Universal point subsets for planar graphs
• A note on universal point sets for planar graphs
• A Note on Universal Point Sets for Planar Graphs

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 6254006 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
• A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
• Drawing planar graphs on \(\frac{8}{9}n^2\) area
• Embedding plane 3-trees in \(\mathbb R^{2}\) and \(\mathbb R^{3}\)
• How to draw a planar graph on a grid
• On embedding an outer-planar graph in a point set
• On point-sets that support planar graphs
• On the hardness of point-set embeddability (extended abstract)
• Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
• Plane 3-trees: embeddability and approximation (extended abstract)
• Point-set embeddings of plane 3-trees
• Small area drawings of outerplanar graphs
• Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
• Small grid drawings of planar graphs with balanced partition
• Small point sets for simply-nested planar graphs
• Superpatterns and universal point sets
• The point-set embeddability problem for plane graphs
• Universal line-sets for drawing planar 3-trees
• Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices

Cited in

(11)

• A Note on Universal Point Sets for Planar Graphs
• Small universal point sets for \(k\)-outerplanar graphs
• Universal point subsets for planar graphs
• A universal point set for 2-outerplanar graphs
• Universal point sets for planar three-trees
• On universal point sets for planar graphs
• On universal point sets for planar graphs
• A note on universal point sets for planar graphs
• Universal line-sets for drawing planar 3-trees
• Universal line-sets for drawing planar 3-trees
• Universal geometric graphs

This page was built for publication: Universal point sets for planar three-trees

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