The linear arboricity of a graph is the minimum number of linear forests into which its lines can be decomposed. We find that the linear arboricity of every 4‐regular graph is 3. This result enables us to obtain bounds for the linear arboricity of any graph in terms of its maximum degree.
No takes yet. Share an insight, caveat, or question.
Akiyama et al. (1981) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: