@article{Zhou2022, 
author = {Xiaoling Zhou and Chao Yang and Weihua He},
title = {The linear    k-arboricity of digraphs},
year = {2022},
journal = {AIMS Mathematics},
volume = {7},
number = {3},
pages = {4137-4152},
keywords = {linear k-arboricity, digraphs, symmetric complete digraphs, symmetric complete bipartite digraphs},
url = {https://www.sciopen.com/article/10.3934/math.2022229},
doi = {10.3934/math.2022229},
abstract = {A linear    k-diforest is a directed forest in which every connected component is a directed path of length at most    k. The linear    k-arboricity of a digraph    D is the minimum number of linear    k-diforests needed to partition the arcs of    D. In this paper, we study the linear    k-arboricity for digraphs, and determine the linear    3-arboricity and linear    2-arboricity for symmetric complete digraphs and symmetric complete bipartite digraphs.}
}