The linear t-arboricity of complete bipartite graphs

摘要

A linear t-forest of G is a subgraph of G whose components are paths with lengths at most t. The linear t-arboricity of G is the minimum number of linear t-forests needed to partition the edge set E(G) of G. In this paper, we obtain the exact value of the linear t-arboricity of some complete bipartite graphs.