论文部分内容阅读
A linear k-forest of an undirected graph G is a subgraph of G whose components are paths with lengths at most k.The linear k-arboricity of G,denoted by lak(G),is the minimum number of linear k-forests needed to partition the edge set E(G)of G.