Stop the war!
Остановите войну!
for scientists:
default search action
"A 1.235 lower bound on the number of points needed to draw all ..."
Maciej Kurowski (2004)
- 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)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.