Title of article
The Linear Arboricity of Planar Graphs without 5-Cycles with Chords
Author/Authors
Chen, Xianglian No Affiliation , Wu, Jian-Liang No Affiliation
Pages
6
From page
285
To page
290
Abstract
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. In this paper, it is proved that for a planar graph G with maximum degree ∆(G) ≥ 7, la(G) =[( ∆(G)) /2] if G has no 5-cycles with chords.
Keywords
Planar graph , linear arboricity , cycle
Journal title
Bulletin of the Malaysian Mathematical Sciences Society
Serial Year
2013
Journal title
Bulletin of the Malaysian Mathematical Sciences Society
Record number
2686314
Link To Document