Parameterized complexity of conflict-free graph coloring (Q2285090)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of conflict-free graph coloring |
scientific article |
Statements
Parameterized complexity of conflict-free graph coloring (English)
0 references
16 January 2020
0 references
conflict-free coloring
0 references
kernelization
0 references
fixed-parameter tractability
0 references
combinatorial bounds
0 references
