Planar graphs have exponentially many 3-arboricities (Q4899062)
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: Planar graphs have exponentially many 3-arboricities |
scientific article; zbMATH DE number 6122023
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs have exponentially many 3-arboricities |
scientific article; zbMATH DE number 6122023 |
Statements
Planar Graphs Have Exponentially Many 3-Arboricities (English)
0 references
4 January 2013
0 references
planar graph
0 references
vertex-arboricity
0 references
digraph chromatic number
0 references
0.8073933124542236
0 references
0.7921250462532043
0 references
0.7844141125679016
0 references
0.7829715609550476
0 references
0.7812638282775879
0 references
