The equitable vertex k-arboricity of a graph G, denoted by v a k = ( G ) , is the smallest integer t such that G has an equitable ( t , k ) -tree-coloring.

Jun 11, 2015 · Title:On the equitable vertex arboricity of complete tripartite graphs. Authors:Zhiwei Guo, Haixing Zhao, Yaping Mao. View a PDF of the paper ...

The strong equitable vertex k-arboricity of complete bipartite equipartition graphs was investigated in 2013. In this paper, we study the strong equitable ...

Equitable vertex arboricity has strong applications such as scheduling. •. Generalize the equitable vertex 1-arboricity of complete bipartite graphs.

Recently, Wu et al. introduced the concept of equitable (t,k)-tree-coloring, which can be viewed as a generalization of proper equitable t-coloring. The strong ...

In this paper, we first get a sharp upper bound of strong equitable vertex arboricity of complete bipartite graph$K_{n,n+\ell} \ (1\leq \ell\leq n)$, that is, ...

Title. On the equitable vertex arboricity of complete tripartite graphs. Authors. Guo, Zhiwei; Zhao, Haixing; Mao, Yaping. Abstract. The equitable coloring ...

Jun 11, 2015 · The equitable coloring problem, introduced by Meyer in 1973, has received consid- erable attention and research.

In this paper, we mainly investigate the strong equitable vertex 2-arboricity of complete tripartite graphs. Equitable vertex arboricity has strong applications ...

The strong equitable vertex k-arboricity of complete bipartite equipartition graphs was investigated in 2013. In this paper, we study the strong equitable ...