Computational complexity of \((2,2)\) path chromatic number problem
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.
scientific article; zbMATH DE number 763886