The linear arboricity of graphs with low treewidth

DOI10.7151/DMGT.2456MaRDI QIDQ6985927zbMATH OpenFDO

Authors Xiang Tan, Jian-Liang Wu

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2456

zbMATH Keywords

graph minorlinear arboricitylinear foresttreewidth

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Cites work

• A partial k-arboretum of graphs with bounded treewidth
• A planar linear arboricity conjecture
• Covering and packing in graphs IV: Linear arboricity
• Graph minors. II. Algorithmic aspects of tree-width
• Graph theory
• scientific article; zbMATH DE number 3989394 (Why is no real title available?)
• scientific article; zbMATH DE number 4060712 (Why is no real title available?)
• scientific article; zbMATH DE number 3717365 (Why is no real title available?)
• scientific article; zbMATH DE number 1299961 (Why is no real title available?)
• List edge-coloring and total coloring in graphs of low treewidth
• The linear arboricity of \(K_5\)-minor free graphs
• The linear arboricity of planar graphs of maximum degree seven is four
• The linear arboricity of series-parallel graphs
• The linear arboricity of some regular graphs

This page was built for publication: The linear arboricity of graphs with low treewidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985927)