The strong equitable vertexk-arboricity of complete bipartite equipartition graphs was investigated in 2013. In this paper, we study the strong equitable vertex3-arboricity of complete equipartition tripartite
On the equitable vertex arboricity of graphs: International Journal of Computer Mathematics: Vol 93, No 6doi:10.1080/00207160.2015.1023794equitablecolouringvertexk-arboricityk-tree-colouringcompletebipartitegraphplanargraphAn equitable
An equitable (t, k)-tree-colouring of a graph G is a t-colouring of vertices of G such that the sizes of any two colour classes differ by at most one and the subgraph induced by each colour class is a forest of maximum degree at most k. The strong equitable vertex k-arboricity, ...
Recently, Wu, Zhang and Li introduced the concept of equitable (t, k)-tree-coloring, which can be viewed as a generalization of proper equitable t-coloring. The strong equitable vertex k-arboricity of complete equipartition bipartite graphs was investigated by Wu, Zhang and Li. in 2013. In ...