Computational complexity of \((2,2)\) path chromatic number problem (Q1891685): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:11, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of \((2,2)\) path chromatic number problem |
scientific article |
Statements
Computational complexity of \((2,2)\) path chromatic number problem (English)
0 references
13 May 1996
0 references
The \((k,r)\) path chromatic number problem is the problem of checking whether vertices of a graph can be colored with \(r\) colors in such a way that each component of the subgraph induced by vertices of any color is a path of order at most \(k\). The author shows that the (2, 2) path chromatic number problem for graphs with maximum degree 4 is NP-complete.
0 references
path chromatic number problem
0 references
path
0 references
NP-complete
0 references
