Advertisement

Graphs and Combinatorics

, Volume 17, Issue 1, pp 11–16 | Cite as

Linear Arboricity and Linear k-Arboricity of Regular Graphs

  • Noga Alon
  • V. J. Teague
  • N. C. Wormald

Abstract.

 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.

Keywords

Regular Graph Probabilistic Argument Linear Arboricity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Tokyo 2001

Authors and Affiliations

  • Noga Alon
    • 1
  • V. J. Teague
    • 2
  • N. C. Wormald
    • 2
  1. 1.School of Mathematics, Institute for Advanced Study, Princeton, NJ 08540, USA and Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel. e-mail: noga@math.tau.ac.ilIL
  2. 2.Department of Mathematics and Statistics, University of Melbourne, Parkville, VIC 3052, Australia. e-mail: 2vjt 3nick@ms.unimelb.edu.auAU

Personalised recommendations