Colouring planar graphs with bounded monochromatic components (Q2182229)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7202888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Colouring planar graphs with bounded monochromatic components |
scientific article; zbMATH DE number 7202888 |
Statements
Colouring planar graphs with bounded monochromatic components (English)
0 references
21 May 2020
0 references
planar graph
0 references
defective colouring
0 references
clustered colouring
0 references
list colouring
0 references
girth
0 references
maximum average degree
0 references
forest decomposition
0 references
fractional arboricity
0 references
nine dragon tree theorem
0 references
0 references
0 references
0 references
0.8323807716369629
0 references
0.8097594976425171
0 references
0.7888434529304504
0 references
0.7878162264823914
0 references
0.7864006161689758
0 references
