Author:
Zhou Xiaoling, ,Yang Chao,He Weihua,
Abstract
<abstract><p>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.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference23 articles.
1. J. Akiyama, G. Exoo, F. Harary, Covering and packing in graphs, III: Cyclic and acyclic invariants, Math. Slovaca, 30 (1980), 405–417.
2. N. Alon, Probabilistic methods in coloring and decomposition problems, Discerte Math., 127 (1994), 31–46. doi: 10.1016/0012-365X(92)00465-4.
3. N. Alon, V. J. Teague, N. C. Wormald, Linear arboricity and linear k-arboricity of regular graphs, Graphs Combinatorics, 17 (2001), 11–16. doi: 10.1007/PL00007233.
4. B. Alspach, J. C. Bermond, D. Sotteau, Decomposition into Cycles I: Hamilton decompositions, 3 Eds., Netherlands: Springer, 1990. doi: 10.1007/978-94-009-0517-7_2.
5. R. D. Baker, R. M. Wilson, Nearly Kirkman triple systems, Utilitas Math., 11 (1977), 289–296.