no code implementations • 9 Mar 2020 • 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.
Combinatorics Discrete Mathematics
