Complexity of equitable tree-coloring problems

Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit

A $(q,t)$\emph{-tree-coloring} of a graph $G$ is a $q$-coloring of vertices of $G$ such that the subgraph induced by each color class is a forest of maximum degree at most $t.$ A $…