The Linear Arboricity of Planar Graphs without 5-, 6-Cycles with Chords

被引：4
作者：
Chen, Hongyu [1 ]
Tan, Xiang [2 ]
Wu, Jianliang [3 ]
Li, Guojun [3 ]
机构：
[1] Shanghai Inst Technol, Sch Sci, Shanghai 201418, Peoples R China
[2] Shandong Univ Finance, Sch Math & Stat, Jinan 250014, Shandong, Peoples R China
[3] Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China
来源：
GRAPHS AND COMBINATORICS | 2013年 / 29卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Planar graph; Linear arboricity; Cycle; PACKING;
D O I：
10.1007/s00373-011-1118-y
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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, if Delta(G) a parts per thousand yen 7 and G has no 5-cycles with chords, or Delta(G) a parts per thousand yen 5 and G has no 5-, 6-cycles with chords.
引用
收藏
页码：373 / 385
页数：13
相关论文
共 14 条
12