1 research outputs found
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
A \emph{-tree-coloring} of a graph is a -coloring of vertices
of such that the subgraph induced by each color class is a forest of
maximum degree at most An \emph{equitable -tree-coloring} of a
graph is a -tree-coloring such that the sizes of any two color
classes differ by at most one. Let the \emph{strong equitable vertex
-arboricity} be the minimum such that has an equitable -tree-coloring for every
In this paper, we find the exact value for each and
$va^\equiv_2(K_{l,m,n}).