Three Complexity Results on Coloring P k -Free Graphs (Q3651537)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three Complexity Results on Coloring P k -Free Graphs |
scientific article |
Statements
Three Complexity Results on Coloring P k -Free Graphs (English)
0 references
11 December 2009
0 references
graph coloring
0 references
\(P _{k }\)-free graph
0 references
computational complexity
0 references
