A note on universal point sets for planar graphs

DOI10.1007/978-3-030-35802-0_27MaRDI QIDQ2206869zbMATH OpenOpenAlexFDO

Authors Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner

Publication date 26 October 2020

Full work available at URL https://arxiv.org/abs/1811.06482

zbMATH Keywords

Boolean satisfiability (SAT)integer programming (IP)order typesimultaneously embeddedstacked triangulation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A Note on Universal Point Sets for Planar Graphs
• On universal point sets for planar graphs
• On universal point sets for planar graphs
• Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
• Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices

Cites work

• A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
• Abstract order type extension and new results on the rectilinear crossing number
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• Drawing planar graphs on \(\frac{8}{9}n^2\) area
• Enumerating order types for small point sets with applications
• Fast generation of some classes of planar graphs
• How to draw a planar graph on a grid
• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• On simultaneous planar graph embeddings
• On universal point sets for planar graphs
• Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
• Practical graph isomorphism. II.
• Superpatterns and universal point sets
• Sweeps, arrangements and signotopes
• Theory and Applications of Satisfiability Testing
• Universal point sets for planar three-trees

Cited in

(8)

• On universal graphs for planar oriented graphs of a given girth
• Faradžev Read-type enumeration of non-isomorphic CC systems
• Universal point sets for planar three-trees
• Wiener Index and Remoteness in Triangulations and Quadrangulations
• A Note on Universal Point Sets for Planar Graphs
• Universal Point Sets for Drawing Planar Graphs with Circular Arcs
• An exponential bound for simultaneous embeddings of planar graphs
• Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices

This page was built for publication: A note on universal point sets for planar graphs

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