Skip to main content
Article thumbnail
Location of Repository

A Planar Linear Arboricity Conjecture

By Marek Cygan, Łukasz Kowalik and Borut Luzar


The linear arboricity la(G) of a graph G is the minimum number of linear forests (graphs where every connected component is a path) that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture (LAC), that the linear arboricity of any simple graph of maximum degree ∆ is either ⌈ ⌉ ⌈ ⌉ ∆ ∆+1

Year: 2010
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.