A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Universal Point Subsets for Planar Graphs
[chapter]
2012
Lecture Notes in Computer Science
A set S of k points in the plane is a universal point subset for a class G of planar graphs if every graph belonging to G admits a planar straight-line drawing such that k of its vertices are represented by the points of S. In this paper we study the following main problem: For a given class of graphs, what is the maximum k such that there exists a universal point subset of size k? We provide a ⌈ √ n ⌉ lower bound on k for the class of planar graphs with n vertices. In addition, we consider the
doi:10.1007/978-3-642-35261-4_45
fatcat:fuaokaa5obatta2sbwcsgx6m2e