Title of article
A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs
Author/Authors
Maciej Kurowski، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2004
Pages
4
From page
95
To page
98
Keywords
graph drawing , Combinatorial problems , Universal set
Journal title
Information Processing Letters
Serial Year
2004
Journal title
Information Processing Letters
Record number
129973
Link To Document