A 1.235 lower bound on the number of points needed to draw...

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

Maciej Kurowski
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
92
Year:
2004
Language:
english
Pages:
4
DOI:
10.1016/j.ipl.2004.06.009
File:
PDF, 88 KB
english, 2004
Conversion to is in progress
Conversion to is failed