We find upper bounds on the linear k-arboricity of d-regular graphs using a probabilistic argument. For small k these bounds are new. For large k they blend into the known upper bounds on the linear arboricity of regular graphs.
|Original language||English (US)|
|Number of pages||6|
|Journal||Graphs and Combinatorics|
|State||Published - Jan 1 2001|
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics