\(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(H\)-colouring \(P_t\)-free graphs in subexponential time |
scientific article |
Statements
\(H\)-colouring \(P_t\)-free graphs in subexponential time (English)
0 references
5 September 2019
0 references
colouring
0 references
\(P_t\)-free graph
0 references
subexponential-time algorithm
0 references
partition function
0 references
path-decomposition
0 references
0 references
0 references
0 references
