Linear Arboricity and Linear k-Arboricity of Regular Graphs

@article{Alon2001LinearAA,
  title={Linear Arboricity and Linear k-Arboricity of Regular Graphs},
  author={Noga Alon and Vanessa Teague and Nicholas C. Wormald},
  journal={Graphs and Combinatorics},
  year={2001},
  volume={17},
  pages={11-16}
}
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. 

1 Figure or Table

Topic