Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:15, 30 January 2024
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
