Complexity of conflict-free colorings of graphs (Q484316): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6383896 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
conflict-free coloring | |||
| Property / zbMATH Keywords: conflict-free coloring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
NP-completeness | |||
| Property / zbMATH Keywords: NP-completeness / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
parametrized algorithm | |||
| Property / zbMATH Keywords: parametrized algorithm / rank | |||
Normal rank | |||
Revision as of 20:07, 30 June 2023
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
