NP-completeness of local colorings of graphs (Q1679905): 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.ipl.2017.09.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2759840798 / rank | |||
Normal rank | |||
Revision as of 20:42, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness of local colorings of graphs |
scientific article |
Statements
NP-completeness of local colorings of graphs (English)
0 references
22 November 2017
0 references
local \(k\)-coloring
0 references
local chromatic number
0 references
planar graph
0 references
NP-complete
0 references
computational complexity
0 references
