Conflict-free coloring of intersection graphs (Q4557736)
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 6984965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conflict-free coloring of intersection graphs |
scientific article; zbMATH DE number 6984965 |
Statements
Conflict-Free Coloring of Intersection Graphs (English)
0 references
26 November 2018
0 references
conflict-free coloring
0 references
intersection graphs
0 references
unit disk graphs
0 references
complexity
0 references
worst-case bounds
0 references
0 references
0 references
0.9956414699554444
0 references
0.8699087500572205
0 references
0.8618223071098328
0 references
