A 1.235 lower bound on the number of points needed to draw all ::::n::::-vertex planar graphs

Maciej Kurowski. A 1.235 lower bound on the number of points needed to draw all ::::n::::-vertex planar graphs. Inf. Process. Lett., 92(2):95-98, 2004. [doi]

Abstract

Abstract is missing.