Skip to main content
SpringerLink
Log in

Linear Arboricity and Linear k-Arboricity of Regular Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  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.il, , , , , , IL

    Noga Alon

  2. Department of Mathematics and Statistics, University of Melbourne, Parkville, VIC 3052, Australia. e-mail: 2vjt 3nick@ms.unimelb.edu.au, , , , , , AU

    V. J. Teague & N. C. Wormald

Authors
  1. Noga Alon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. J. Teague
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. C. Wormald
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: December 21, 1998 Final version received: July 26, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alon, N., Teague, V. & Wormald, N. Linear Arboricity and Linear k-Arboricity of Regular Graphs. Graphs Comb 17, 11–16 (2001). https://doi.org/10.1007/PL00007233

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00007233

Keywords

Search

Navigation