Authors: Hongyu Chen Xiang Tan Jianliang Wu Guojun Li
Publish Date: 2011/12/23
Volume: 29, Issue: 3, Pages: 373-385
Abstract
The linear arboricity laG 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 laG=lceilfracDeltaG2rceil if ΔG ≥ 7 and G has no 5cycles with chords or ΔG ≥ 5 and G has no 5 6cycles with chords
Keywords: