Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Improved complexity results on \(k\)-coloring \(P_t\)-free graphs |
scientific article |
Statements
Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (English)
0 references
30 September 2015
0 references
4-coloring
0 references
5-coloring
0 references
0 references