The linear arboricity of planar graphs with maximum degree at least 5
Let G be a planar graph with maximum degree Delta(G) >= 5. It is proved that la(G) = inverted right perpendicular Delta(G)/2inverted left perpendicular if G has no intersecting 4-cycles and intersecting 5-cycles. (c) 2012 Elsevier B.V. All rights reserved.
linear arboricity planar graph combinatorial problems cycle