The strong equitable vertex 1-arboricity of complete bipartite graphs and balanced complete k-partite graphs

Janejira Laomala, Keaitsuda Nakprasit, Kittikorn Nakprasit +1

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