Equitable vertex arboricity of graphs

Jian-Liang Wu, Xin Zhang, Hailun Li

An equitable $(t,k,d)$-tree-coloring of a graph $G$ is a coloring to vertices of $G$ such that the sizes of any two color classes differ by at most one and the subgraph induced by…