Linear arboricity and linear \(k\)-arboricity of regular graphs (Q5936088): Difference between revisions

The linear arboricity \(\text{la}(G)\) (respectively, \(k\)-linear arboricity \(\text{la}_k(G)\)), of a graph \(G\) is the minimum number of forests, each of whose components is a path (respectively, each of whose components is a path of length at most \(k\)) required to partition \(E(G)\); \(\text{la}_k(d)\) is defined to be \(\max_{G \text{ is }d}-regular\)