The Linear 4-arboricity of Balanced Complete Bipartite Graphs.

A linear k-forest is a graph whose components are paths of length at most k. The linear k-arboricity of a graph G, denoted by lak(G), is the least number of linear k-forests needed to decompose G. In this paper, it is obtained that la4(Kn,n) =[5n/8] for n ≡ 0( mod 5). [ABSTRACT FROM AUTHOR]