The linear arboricity of graphs with low treewidth
Discussiones Mathematicae. Graph Theory, Tome 44 (2024) no. 2, pp. 475-487
Voir la notice de l'article provenant de la source Library of Science
Let G be a graph with treewidth k. In the paper, it is proved that if k≤ 3 and maximum degree Δ≥ 5, or k=4 and Δ≥ 9, or Δ≥ 4k-3 and k≥ 5, then the linear arboricity la(G) of G is ⌈Δ2⌉.
Keywords:
graph, minor, linear arboricity, linear forest, treewidth
@article{DMGT_2024_44_2_a3,
author = {Tan, Xiang and Wu, Jian-Liang},
title = {The linear arboricity of graphs with low treewidth},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {475--487},
publisher = {mathdoc},
volume = {44},
number = {2},
year = {2024},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2024_44_2_a3/}
}
Tan, Xiang; Wu, Jian-Liang. The linear arboricity of graphs with low treewidth. Discussiones Mathematicae. Graph Theory, Tome 44 (2024) no. 2, pp. 475-487. http://geodesic.mathdoc.fr/item/DMGT_2024_44_2_a3/