Title of article
The Linear Arboricity of Planar Graphs with Maximum Degree at Least Five
Author/Authors
Tan, Xiang Shandong University of Finance - School of Statistics and Mathematics, China , Tan, Xiang Shandong University - School of Mathematics, China , Chen, Hongyu Shanghai Institute of Technology - School of Science, China , Chen, Hongyu Shandong University - School of Mathematics, China , Wu, Jianliang Shandong University - School of Mathematics, China
From page
541
To page
552
Abstract
Let G be a planar graph with maximum degree Δ≥5. It is proved that la(G)=[Δ(G)/2] if (1) any 4-cycle is not adjacent to an i-cycle for any i∈{3,4,5} or (2) G has no intersecting 4-cycles and intersecting i-cycles for some i∈{3,6}.
Keywords
Planar graph , linear arboricity , cycle
Journal title
Bulletin of the Malaysian Mathematical Sciences Society
Journal title
Bulletin of the Malaysian Mathematical Sciences Society
Record number
2549945
Link To Document