[1] Harary F. Covering and packing in graphs 1 [J]. Annals of the New York Academy of Sciences, 1970, 175(1): 198-205.
[2] Akiyama J, Exoo G, Harary F. Covering and packing in graphs 3: cyclic and acyclic invariants [J]. Math Slovaca, 1980, 30(4): 405-417.
[3] Akiyama J, Exoo G, Harary F. Covering and packing in graphs 4: linear arboricity [J]. Networks, 1981, 11(1): 69-72.
[4] Enomoto H, Péroche B. The linear arboricity of some regular graphs [J]. Journal of Graph Theory, 1984, 8(2): 309-324.
[5] Guldan F. The linear arboricity of 10-regular graphs [J]. Math Slovaca, 1986, 36(3): 225-228.
[6] Martinova M K. Linear arboricity of maximal outerplanar graphs [J]. Godishnik Vissh Uchebn Zaved Prilozhna Math, 1987, 23: 147-155.(in Bulgarian)
[7] Wu Jianliang. On the linear arboricity of planar graphs [J]. Journal of Graph Theory, 1999, 31(2): 129-134.
[8] Wu Jianliang, Wu Yuwen. The linear arboricity of planar graphs of maximum degree seven are four [J]. Journal of Graph Theory, 2008, 58(3): 210-220.
[9] Wu Jianliang. The linear arboricity of series-parallel graphs [J]. Graphs and Combinatorics, 2000, 16(3): 367-372.
[10] Lu Xiaoxu, Xu Baogang. A note on vertex-arboricity of plane graphs [J]. Journal of Nanjing University: Natural Sciences, 2007, 43(1): 13-18.
[11] Tan Xiang, Chen Hongyu, Wu Jianliang. The linear arboricity of planar graphs with maximum degree at least five [J]. Bulletin of the Malaysian Mathematical Sciences Society, 2011, 34(3): 541-552.
[12] Wu Jianliang, Hou Jianfeng, Liu Guizhen. The linear arboricity of planar graphs with no short cycles [J]. Theoretical Computer Science, 2007, 381(1/2/3): 230-233.
[13] Bollobàs B. Modern graph theory [M]. New York:Springer-Verlag, 1998.
[14] Chen B L, Huang K C. On the linear k-arboricity of K_{n} and K_{n, n} [J]. Discrete Math, 2002, 254(1/2/3): 51-61.