Complexity of tree-coloring interval graphs equitably

Bei Niu, Bi Li, Xin Zhang

An equitable tree-$k$-coloring of a graph is a vertex $k$-coloring such that each color class induces a forest and the size of any two color classes differ by at most one. In this…