An upper bound on the number of edges in an almost planar bipartite graph (Q744552)
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: An upper bound on the number of edges in an almost planar bipartite graph |
scientific article; zbMATH DE number 6347737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound on the number of edges in an almost planar bipartite graph |
scientific article; zbMATH DE number 6347737 |
Statements
An upper bound on the number of edges in an almost planar bipartite graph (English)
0 references
25 September 2014
0 references
drawings of complete bipartite graphs on a plane
0 references
0 references
0.8204249739646912
0 references
0.7931894659996033
0 references
0.7785896062850952
0 references
0.7736166715621948
0 references
0.7733056545257568
0 references
