![](/img/cover-not-exists.png)
A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs
Maciej KurowskiVolume:
92
Year:
2004
Language:
english
Pages:
4
DOI:
10.1016/j.ipl.2004.06.009
File:
PDF, 88 KB
english, 2004