Graph Minimal Uncolorability is ${\text{D}}^{\text{p}} $-Complete (Q3029023)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph Minimal Uncolorability is ${\text{D}}^{\text{p}} $-Complete |
scientific article |
Statements
Graph Minimal Uncolorability is ${\text{D}}^{\text{p}} $-Complete (English)
0 references
1987
0 references
NP-completeness
0 references
\(D^ P\)-completeness
0 references
graph coloring
0 references
planar graph coloring
0 references
