The linear 2-arboricity of planar graphs

zbMath1018.05019MaRDI QIDQ1401562

Li-Da Tong, Ko-Wei Lih, Wei Fan Wang

Publication date: 18 August 2003

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

zbMATH Keywords

forestscomponent trees

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)

Related Items (16)

An improved upper bound on the linear 2-arboricity of 1-planar graphs ⋮ 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 IC-planar graphs ⋮ The linear 2-arboricity of sparse graphs ⋮ Linear 2-arboricity of toroidal 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}\) ⋮ A note on the linear 2-arboricity of planar graphs ⋮ A structural theorem for planar graphs with some applications ⋮ Planar graphs without 5-cycles or without 6-cycles ⋮ Light structures in 1-planar graphs with an application to linear 2-arboricity ⋮ The linear \((n - 1)\)-arboricity of some lexicographic product graphs ⋮ On linear 2-arboricity of certain graphs ⋮ The linear 2-arboricity of 1-planar graphs without 3-cycles

This page was built for publication: The linear 2-arboricity of planar graphs