Abstract
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. Akiyama, Exoo and Harary conjectured that \(\lceil \frac{\Delta }{2}\rceil \le la(G)\le \lceil \frac{\Delta +1}{2}\rceil \) for any graph G with maximum degree \(\Delta \), and proved the conjecture holds for forests. This conjecture has been verified for certain graph families with treewidth at most 3. In the paper we improve these former results by validating the conjecture for all graphs with treewidth at most 4.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Akiyama, J., Exoo, G., Harary, F.: Covering and packing in graphs III. Cyclic and acyclic invariants, Math. Slovaca 30(4), 405-417 (1980)
Akiyama, J., Exoo, G., Harary, F.: Covering and packing in graphs IV. Linear Arboricity Netw. 11(1), 69–72 (1981)
Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(12), 1–45 (1998)
Bodlaender, H.L.: Planar graphs with bounded treewidth, Tech. rep. ruu-cs-88-14, Department of Computer Science, University of Utrecht (1988)
Bruhn, H., Lang, R., Stein, M.: List edge-coloring and total coloring in graphs of low treewidth, J. Graph Theory, 272-282 (2015)
Diestel, R.: Graph Theory, vol.4, springer-verlag, New York (2010)
Enomoto, H., P\(\acute{e}\)roche, B.: The linear arboricity of some regular graphs, J. Graph Theory 8, 309-324 (1984)
Guldan, F.: The linear arboricity of 10 regular graphs. Math slovaca 36, 225–228 (1986)
Harary, F.: covering and packing in Graphs I. Ann. New York Acad. Sci. 175, 198–205 (1970)
Meeks, K., Scott, A.: The parameterised complexity of list problems on graphs of bounded treewidth. Inform. Comput. 251, 91–103 (2016)
Wu, J.L.: On the linear arboricity of planar graphs. J. Graph Theory 31, 129–134 (1999)
Wu, J.L.: Some path decompositions of Halin graphs. Shandong kuangye xueyuan xuebao 17(1), 92–96 (1998)
Wu, J.L.: The linear arboricity of series-parallel graphs. Graphs Combin. 16(3), 367–372 (2000)
Wu, J.L., Liu, G., Wu, Y.: The linear arboricity of Composition graphs. J. Syst. Sci. Complex 15(4), 372–375 (2002)
Wu, J.L., Wu, Y.W.: The linear arboricity of planar graphs of maximum degree seven are four. J. Graph Theory 58, 210–220 (2008)
Funding
The authors have not disclosed any funding.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that there are no competing interests regarding the publication of this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work was supported by NSFC (No.11401386), Young and middle-aged science and technology talent development fund of Shanghai Institute of Technology (No. ZQ2019-22).
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Chen, HY., Lai, HJ. On the Linear Arboricity of Graphs with Treewidth at Most Four. Graphs and Combinatorics 39, 70 (2023). https://doi.org/10.1007/s00373-023-02673-5
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-023-02673-5