# Linear arboricity

In graph theory, a branch of mathematics, the linear arboricity of an undirected graph is the smallest number of linear forests its edges can beâ€¦Â (More)
Wikipedia

1980-2018

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
• CIAC
• 2010
The linear arboricity la(G) of a graph G is the minimum number of linear forests (graphs where every connected component is aâ€¦Â (More)
Is this relevant?
2007
2007
• Theor. Comput. Sci.
• 2007
The linear arboricity of a graph G is the minimum number of linear forests which partition the edges of G. Akiyama, Exoo andâ€¦Â (More)
Is this relevant?
2001
2001
• Graphs and Combinatorics
• 2001
We find upper bounds on the linear k-arboricity of d-regular graphs using a probabilistic argument. For small k these bounds areâ€¦Â (More)
Is this relevant?
2000
2000
The linear arboricity laÂ…GÂ† of a graph G is the minimum number of linear forests which partition the edges of G. A graph isâ€¦Â (More)
Is this relevant?
1999
1999
It is proved that the linear arboricity of every 1-planar graph with maximum degree âˆ† > 33 is âŒˆâˆ†/2âŒ‰.Â
Is this relevant?
1990
1990
• Random Struct. Algorithms
• 1990
An easy count ing argument shows here that la(G)>f . f f t " d i f f icu l ty is in establishing the upper bound. This problemâ€¦Â (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
A linear forest is a forest in which each connected component is a path. The linear arboricity la(G) of a graph G is the minimumâ€¦Â (More)
Is this relevant?
1987
1987
Akiyama, Exoo, and Harary conjectured that for any simple graph G with maximum degree A ( G ) . the linear arboricity / a ( Gâ€¦Â (More)
Is this relevant?
1984
1984
• Journal of Graph Theory
• 1984
We prove that the linear arboricity of every 5-regular graph is 3. That is, the edges of any 5-regular graph are covered by threeâ€¦Â (More)
Is this relevant?
1980
1980
In a linear forest, each component is a path. The linear arboricity ~(G) of a graph G is defined in Harary [8] as the minimumâ€¦Â (More)
Is this relevant?