The Linear Arboricity of W_5 -minor free graphs
Author:
Preprint
- 7 October 2026
- preprint
- Published by Elsevier in SSRN Electronic Journal
Abstract
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. In 1980, Akiyama et al. conjectured that for any graph G, \la{\Delta(G)}\leq la(G) \leq \la{\Delta(G)+1}. In the paper, we establish the essential structural properties of W_5-minor free graphs G and then prove here that if G is a W_5-minor free graph and \Delta (G)\geq 5, then la(G)= \la{\Delta(G)}.Keywords
This publication has 24 references indexed in Scilit:
- A Planar linear arboricity conjectureJournal of Graph Theory, 2011
- Graph Theory2010
- The linear arboricity of planar graphs of maximum degree seven is fourJournal of Graph Theory, 2008
- Linear Arboricity and Linear k-Arboricity of Regular GraphsGraphs and Combinatorics, 2001
- On the linear arboricity of planar graphsJournal of Graph Theory, 1999
- The linear arboricity of graphsIsrael Journal of Mathematics, 1988
- Linear arboricity for graphs with multiple edgesJournal of Graph Theory, 1987
- Linear arboricity of digraphsNetworks, 1987
- The linear arboricity of some regular graphsJournal of Graph Theory, 1984
- Covering and packing in graphs IV: Linear arboricityNetworks, 1981