×

Linear arboricity for graphs with maximum degree six or seven and edge- multiplicity two. (English) Zbl 0595.05021

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

MSC:

05C05 Trees
PDFBibTeX XMLCite