Maximizing the size of planar graphs under girth constraints (Q2875897)
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: Maximizing the size of planar graphs under girth constraints |
scientific article; zbMATH DE number 6329399
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing the size of planar graphs under girth constraints |
scientific article; zbMATH DE number 6329399 |
Statements
12 August 2014
0 references
maximal number of edges
0 references
extremal \(C_t\)-free graphs
0 references
Maximizing the size of planar graphs under girth constraints (English)
0 references
0.8405265808105469
0 references
0.8171735405921936
0 references
0.8067287802696228
0 references
