Complexity of conflict-free colorings of graphs (Q484316): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:25, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of conflict-free colorings of graphs |
scientific article |
Statements
Complexity of conflict-free colorings of graphs (English)
0 references
6 January 2015
0 references
conflict-free coloring
0 references
NP-completeness
0 references
parametrized algorithm
0 references
