On the linear arboricity of graphs with treewidth at most four

DOI10.1007/s00373-023-02673-5zbMath1518.05151OpenAlexW4381190438MaRDI QIDQ6172210

No author found.

Publication date: 19 July 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-023-02673-5

zbMATH Keywords

treewidthlinear arboricitylinear coloring

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The parameterised complexity of list problems on graphs of bounded treewidth
• A partial k-arboretum of graphs with bounded treewidth
• The linear arboricity of series-parallel graphs
• The linear arboricity of composition graphs
• List Edge-Coloring and Total Coloring in Graphs of Low Treewidth
• The linear arboricity of planar graphs of maximum degree seven is four
• The linear arboricity of some regular graphs
• Covering and packing in graphs IV: Linear arboricity
• COVERING AND PACKING IN GRAPHS, I.

This page was built for publication: On the linear arboricity of graphs with treewidth at most four