Complexity of correspondence \(H\)-colourings (Q2184689)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of correspondence \(H\)-colourings |
scientific article |
Statements
Complexity of correspondence \(H\)-colourings (English)
0 references
29 May 2020
0 references
graph homomorphisms
0 references
\(H\)-colourings
0 references
correspondence colourings
0 references
DP-colourings
0 references
dichotomy
0 references
NP-completeness
0 references
polynomial algorithms
0 references
