A linear k-forest is a graph whose components are paths with lengths at most k. The minimum number of linear k-forests needed to decompose a graph G is the linear k-arboricity of G and denoted by lak(G). In this aper, we settle the cases left in determining the linear 2-arboricity of the complete graph Kn. Mainly, we prove that la2(K12t+10) = la2(K12t+11) = 9t+8 for any t0.
展开▼
