The linear arboricity of planar graphs with maximum degree at least 5

DOI10.1016/j.ipl.2012.06.007zbMath1248.05043OpenAlexW2082585403MaRDI QIDQ456114

Hong-Yu Chen, Jian-Ming Qi

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.06.007

zbMATH Keywords

cyclecombinatorial problemslinear arboricityplanar graphlinear forest

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

The linear arboricity of \(K_5\)-minor free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The linear arboricity of planar graphs with maximum degree at least five
• The linear arboricity of planar graphs with no short cycles
• The linear arboricity of series-parallel graphs
• The linear arboricity of composition graphs
• The linear arboricity of planar graphs without 5-, 6-cycles with chords
• A Planar linear arboricity conjecture
• The linear arboricity of planar graphs of maximum degree seven is four
• The linear arboricity of some regular graphs
• Covering and packing in graphs IV: Linear arboricity
• COVERING AND PACKING IN GRAPHS, I.

This page was built for publication: The linear arboricity of planar graphs with maximum degree at least 5