An improved upper bound on the linear 2-arboricity of planar graphs

DOI10.1016/j.disc.2015.07.003zbMath1322.05045OpenAlexW1640262016MaRDI QIDQ501025

Yi Qiao Wang

Publication date: 8 October 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.07.003

zbMATH Keywords

planar graphmaximum degreelinear 2-arboricity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

The linear 2-arboricity of sparse graphs ⋮ Linear 2-arboricity of toroidal graphs ⋮ A note on the linear 2-arboricity of planar graphs ⋮ On linear 2-arboricity of certain graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On linear k-arboricity
• Planar graphs without 5-cycles or without 6-cycles
• Some problems about linear arboricity
• Algorithmic aspects of linear \(k\)-arboricity
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
• On the linear \(k\)-arboricity of cubic graphs
• The linear 2-arboricity of planar graphs
• Linear \(k\)-arboricities on trees
• On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
• On the total coloring of planar graphs.