Complexity of conflict-free colorings of graphs (Q484316): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.029 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033159765 / rank | |||
Normal rank | |||
Revision as of 03:46, 20 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
