The linear arboricity of graphs  with low treewidth

Tan, Xiang; Wu, Jian-Liang

doi:10.7151/dmgt.2456

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…). The Linear Arboricity Conjecture has also been proven for graphs of bounded sparsity (e.g., bounded degeneracy, treewidth, pseudoarboricity) when the maximum degree is sufficiently large (see [9,11,37,40]).…”

Section: Introductionmentioning

confidence: 99%

On an $f$-coloring generalization of linear arboricity of multigraphs

Wdowinski¹

2023

Preprint

View full text Add to dashboard Cite

Given a multigraph G and function f : V (G) → Z ≥2 on its vertices, a degree-f subgraph of G is a spanning subgraph in which every vertex v has degree at most f (v). The degree-f arboricity a f (G) of G is the minimum number of colors required to edge-coloris the usual arboricity of G. This is a strong generalization of the Linear Arboricity Conjecture due to Akiyama, Exoo, and Harary. In this paper, we disprove Truszczyński's conjecture in a strong sense for general multigraphs. On the other hand, extending known results for linear arboricity, we prove that the conjecture holds for simple graphs with sufficiently large girth, and that it holds for all simple graphs asymptotically. More strongly, we prove these partial results in the setting of directed graphs, where the color classes are required to be analogously defined degree-f branchings.

show abstract

Section: Introductionmentioning

confidence: 99%