Complexity of conflict-free colorings of graphs (Q484316): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2014.11.029 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2014.11.029 / rank | |||
Normal rank | |||
Latest revision as of 18:56, 9 December 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
0 references
