Universal Point Subsets for Planar Graphs
From MaRDI portal
Publication:4909559
DOI10.1007/978-3-642-35261-4_45zbMath1260.05039OpenAlexW1603166311MaRDI QIDQ4909559
Giuseppe Liotta, Patrizio Angelini, Tamara Mchedlidze, Ferran Hurtado, Carla Binucci, Yoshio Okamoto, William S. Evans, Henk G. Meijer
Publication date: 21 March 2013
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/18077
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)
Related Items (5)
Dual circumference and collinear sets ⋮ Drawing Planar Graphs with Many Collinear Vertices ⋮ Small universal point sets for \(k\)-outerplanar graphs ⋮ Every collinear set in a planar graph is free ⋮ Unnamed Item
This page was built for publication: Universal Point Subsets for Planar Graphs