The linear k-arboricity of symmetric directed trees

The linear k-arboricity of symmetric directed trees

Blog Article

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 Dining a digraph D is the minimum number of arc-disjoint linear k-diforests whose union covers all the arcs Sideboard 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.