Strong Equitable Vertex Arboricity in Cartesian Product Networks

An equitable (t,k)-tree-coloring of a graph G is defined as a t-coloring of vertices of G such that each component of the subgraph induced by each color class is a tree of maximum degree at most k,...