The linear 3-arboricity of image and image Original Research Article

A linear k-forest is a forest whose components are paths of length at most k. The linear k-arboricity of a graph G, denoted by image, is the least number of linear k-forests needed to decompose G. In this paper, we completely determine image when G is a balanced complete bipartite graph image or a complete graph image, and image.