@article{Zhou2022, 
author = {Xiaoling Zhou and Chao Yang and Weihua He},
title = {The linear    k-arboricity of symmetric directed trees},
year = {2022},
journal = {AIMS Mathematics},
volume = {7},
number = {2},
pages = {1603-1614},
keywords = {linear k-arboricity, digraphs, directed trees, symmetric directed trees, linear arboricity},
url = {https://www.sciopen.com/article/10.3934/math.2022093},
doi = {10.3934/math.2022093},
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 arc-disjoint linear    k-diforests whose union covers all the arcs of    D. In this paper, we study the linear    k-arboricity for symmetric directed trees and fully determine the linear    2-arboricity for all symmetric directed trees.}
}