A 1.235 lower bound on the number of points needed to draw all <i>n</i>-vertex planar graphs.

Maciej Kurowski A 1.235 lower bound on the number of points needed to draw all <i>n</i>-vertex planar graphs. 95-98 2004 92 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/j.ipl.2004.06.009 db/journals/ipl/ipl92.html#Kurowski04