A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (Q834906)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs |
scientific article; zbMATH DE number 5599139
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs |
scientific article; zbMATH DE number 5599139 |
Statements
A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (English)
0 references
27 August 2009
0 references
graph drawing
0 references
universal set
0 references
combinatorial problems
0 references
0.7918838262557983
0 references
0.7823846340179443
0 references
0.7815996408462524
0 references
0.7808400392532349
0 references
0.7791960835456848
0 references
