A data structure for dynamic trees
Journal of Computer and System Sciences
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Journal of the ACM (JACM)
A Generalization of Kotzig’s Theorem and Its Application
SIAM Journal on Discrete Mathematics
The linear arboricity of planar graphs with no short cycles
Theoretical Computer Science
On the linear arboricity of planar graphs
Journal of Graph Theory
The linear arboricity of planar graphs of maximum degree seven is four
Journal of Graph Theory
The linear arboricity of planar graphs with maximum degree at least 5
Information Processing Letters
Hi-index | 0.00 |
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. [Math Slovaca 30 (1980), 405–417] stated the Linear Arboricity Conjecture (LAC) that the linear arboricity of any simple graph of maximum degree Δ is either ⌈Δ/2⌉ or ⌈(Δ + 1)/2⌉. In [J. L. Wu, J Graph Theory 31 (1999), 129–134; J. L. Wu and Y. W. Wu, J Graph Theory 58(3) (2008), 210–220], it was proven that LAC holds for all planar graphs. LAC implies that for Δ odd, la(G) = ⌈Δ/2⌉. We conjecture that for planar graphs, this equality is true also for any even Δ⩾6. In this article we show that it is true for any even Δ⩾10, leaving open only the cases Δ = 6, 8. We present also an O(n logn) algorithm for partitioning a planar graph into max{la(G), 5} linear forests, which is optimal when Δ⩾9. © 2010 Wiley Periodicals, Inc. J Graph Theory © 2012 Wiley Periodicals, Inc. (Contract grant sponsor: Bilateral Project; Contract grant number: BI-PL/08-09-008 (to M. C., Ł. K., and B. L.); Contract grant sponsor: Polish Ministry of Science and Higher Education; Contract grant number: N206 355636 (to M. C. and Ł. K.); Contract grant sponsor: National Natural Science Foundation of China; Contract grant numbers: 10871119; 10971121; 10901097; 10631070; 11001055 (to J.-F. Hou and J.-L. Wu); Contract grant sponsor: European Union, European Social Fund (to B. L.).)