Some results on linear arboricity

Author:

Abstract
The linear arboricity of the graph G is the minimum number of linear forests whose union is G. In the paper exact values and bounds of linear arboricity for some additional classes of graphs are determined.

This publication has 6 references indexed in Scilit: