NP-completeness of local colorings of graphs (Q1679905)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NP-completeness of local colorings of graphs |
scientific article; zbMATH DE number 6810897
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness of local colorings of graphs |
scientific article; zbMATH DE number 6810897 |
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
0.9343644
0 references
0.9335961
0 references
0.9282603
0 references
0 references
0 references
0.9212516
0 references
0 references
0.9203959
0 references
