Subclasses of the planar graphs may, in general, have smaller universal sets (sets of points that allow straight-line drawings of all n-vertex graphs in the subclass) than the full class of planar graphs, and in many cases universal point sets of exactly n points are possible.
Planar graphs that can be partitioned into nested cycles, and planar graphs of bounded pathwidth, have universal point sets of nearly-linear size [REF].