1 |
G. J. Chang, B. L. Chen, H. L. Fu, and K. C. Huang, Linear k-arboricity on trees, Discrete Appl. Math. 103 (2000), no. 1-3, 281-287.
DOI
ScienceOn
|
2 |
B. L. Chen, H. L. Fu, and K. C. Huang, Decomposing graphs into forests of paths with size less than three, Australas. J. Combin. 3 (1991), 55-73.
|
3 |
H. L. Fu and K. C. Huang, The linear 2-arboricity of complete bipartite graphs, Ars Combin. 38 (1994), 309-318.
|
4 |
M. Habib and B. Peroche, Some problems about linear arboricity, Discrete Math. 41 (1982), no. 2, 219-220.
DOI
ScienceOn
|
5 |
B. Jackson and N. C. Wormald, On linear k-arboricity of cubic graphs, Discrete Math. 162 (1996), no. 1-3, 293-297.
DOI
ScienceOn
|
6 |
K. W. Lih, L. D. Tong, and W. F. Wang, The linear 2-arboricity of planar graphs, Graphs Combin. 19 (2003), no. 2, 241-248.
|
7 |
Q. Ma and J. L. Wu, Planar graphs without 5-cycles or without 6-cycles, Discrete Math. (2008), doi:10.1016/j.disc.2008.07.033.
DOI
ScienceOn
|
8 |
J. Qian and W. F. Wang, The linear 2-arboricity of planar graphs without 4-cycles, J. Zhejiang Norm. Univ. 29 (2006), no. 2, 121-125.
|
9 |
C. Thomassen, Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5, J. Combin. Theory Ser. B 75 (1999), no. 1, 100-109.
DOI
ScienceOn
|
10 |
R. E. L. Aldred and N. C. Wormald, More on the linear k-arboricity of regular graphs, Australas. J. Combin. 18 (1998), 97-104.
|
11 |
J. C. Bermond, J. L. Fouquet, M. Habib, and B. Peroche, On linear k-arboricity, Discrete Math. 52 (1984), no. 2-3, 123-132.
DOI
ScienceOn
|
12 |
G. J. Chang, Algorithmic aspects of linear k-arboricity, Taiwanese J. Math. 3 (1999), no. 1, 73-81.
|