Algorithmic aspects of linear \(k\)-arboricity

DOI10.11650/twjm/1500407055zbMath0927.05073OpenAlexW4246719015MaRDI QIDQ1301997

Gerard Jennhwa Chang

Publication date: 5 December 1999

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500407055

zbMATH Keywords

treecharacterizationlinear arboricitylinear time algorithmlinear forestlinear \(k\)-arboricitylinear \(k\)-forest

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles ⋮ On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\) ⋮ The linear 2-arboricity of sparse graphs ⋮ The linear 3-arboricity of \(K_{n,n}\) and \(K_n\) ⋮ An improved upper bound on the linear 2-arboricity of planar graphs ⋮ The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\) ⋮ Path partition for graphs with special blocks ⋮ Planar graphs without 5-cycles or without 6-cycles ⋮ Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree ⋮ Linear \(k\)-arboricities on trees ⋮ The linear \((n - 1)\)-arboricity of some lexicographic product graphs

This page was built for publication: Algorithmic aspects of linear \(k\)-arboricity