Aït-Djafer, Houria Linear arboricity for graphs with maximum degree six or seven and edge- multiplicity two. (English) Zbl 0595.05021 Ars Comb. 20A, 5-16 (1985). A linear forest in a graph is a subgraph whose components are all paths. The linear arboricity of a graph G is the minimum number of linear forests into which the edges of G can be decomposed. This paper proves that the linear arboricity of every graph with edge multiplicity two and maximum egree 6 (respectively 7) is at most 4 (respectively 5). Reviewer: A.Tucker Cited in 4 Documents MSC: 05C05 Trees Keywords:graph decomposition; linear forest; linear arboricity PDFBibTeX XMLCite \textit{H. Aït-Djafer}, Ars Comb. 20A, 5--16 (1985; Zbl 0595.05021)