Linear Size Universal Point Sets for Classes of Planar Graphs

Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder +1

A finite set $P$ of points in the plane is $n$-universal with respect to a class $\mathcal{C}$ of planar graphs if every $n$-vertex graph in $\mathcal{C}$ admits a crossing-free st…