Three colors suffice: conflict-free coloring of planar graphs (Q4575874)
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 6904155
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three colors suffice: conflict-free coloring of planar graphs |
scientific article; zbMATH DE number 6904155 |
Statements
Three Colors Suffice: Conflict-Free Coloring of Planar Graphs (English)
0 references
16 July 2018
0 references
0 references
0.8621906638145447
0 references
0.8618223071098328
0 references
0.8503459095954895
0 references
