Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657)
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: Parameterized Complexity of Conflict-Free Graph Coloring |
scientific article; zbMATH DE number 7396317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized Complexity of Conflict-Free Graph Coloring |
scientific article; zbMATH DE number 7396317 |
Statements
Parameterized Complexity of Conflict-Free Graph Coloring (English)
0 references
17 September 2021
0 references
conflict-free coloring
0 references
kernelization
0 references
fixed-parameter tractability
0 references
combinatorial bounds
0 references
0 references
0.9971904158592224
0 references
0.8801391124725342
0 references
0.8797178268432617
0 references
0.8747559785842896
0 references
0.853069543838501
0 references
