@article{MASLO_1994_44_1_a12,
author = {Knor, Martin},
title = {Note on linear arboricity},
journal = {Mathematica slovaca},
pages = {117--122},
year = {1994},
volume = {44},
number = {1},
mrnumber = {1290280},
zbl = {0795.05112},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MASLO_1994_44_1_a12/}
}
Knor, Martin. Note on linear arboricity. Mathematica slovaca, Tome 44 (1994) no. 1, pp. 117-122. http://geodesic.mathdoc.fr/item/MASLO_1994_44_1_a12/
[1] AÏT-DJAFER H.: Linear arboricity for graphs with maximum degree six or seven and edge multiplicity two. Ars Combin. A 22 (1985), 5-16. | MR | Zbl
[2] AÏT-DJAFER H.: Linear arboricity for graphs with multiple edges. J. Graph Theоry 11 (1987), 135-140. | MR | Zbl
[3] AKIYAMA J., EXOO G., HARRARY F.: Covering and packing in graphs III. Cyclic and acyclic invariants. Math. Slоvaca 30 (1980), 405-417. | MR
[4] AKIYAMA J., EXOO G., HARRARY F.: Covering and packing in graphs IV. Linear arboricity. Networks 11 (1981), 69-72. | MR
[5] ALON N.: The linear arboiгcity of graphs. Israel J. Math. 62 (1988). 311-325. | MR
[6] ENOMOTO H., PEROCHE B.: The linear arboricity of some regular graphs. J. Graph Theогy 8 (1984), 309-324. | MR | Zbl
[7] GULDAN F.: The linear arboricity of 10-regular graphs. Math. Slоvaca 36 (1986). 225-228. | MR
[8] HORÁK P., NIEPEL Ľ.: A short proof of a linear arboricity theorem for cubic graphs. Acta Math. Univ. Cоmenian. XL-XLI (1982), 275-277. | MR | Zbl
[9] NASH-WILLIAMS C. ST. J. A.: Edge-disjoint spanning trees of finite graphs. J. Lоndоn Math. Soc. 36 (1961), 445-450. | MR | Zbl
[10] NASH-WILLIAMS C. ST. J. A.: Decompositions of finite graphs into forests. J. Lоndоn Math. Sоc. 39 (1964), 12. | MR
[11] TOMASTA P.: Note on linear arboricity. Math. Slоvaca 32 (1982), 239-242. | MR | Zbl
[12] TUTTE W. T.: On the problem of decomposing a graph into n connected factors. J. Lоndоn Math. Sоc. 36 (1961), 221-230. | MR | Zbl