Linear Arboricity and Linear k-Arboricity of Regular Graphs
- 120 Downloads
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.
KeywordsRegular Graph Probabilistic Argument Linear Arboricity
Unable to display preview. Download preview PDF.