Conflict-free coloring of graphs (Q4556952)
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 6986036
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conflict-free coloring of graphs |
scientific article; zbMATH DE number 6986036 |
Statements
Conflict-Free Coloring of Graphs (English)
0 references
28 November 2018
0 references
conflict-free coloring
0 references
planar graphs
0 references
complexity
0 references
worst-case bounds
0 references
0 references
0 references
0.9634969830513
0 references
0.9061301350593568
0 references
0.8744836449623108
0 references
0.8699087500572205
0 references
0.8561258316040039
0 references
