On the linear arboricity of graphs embeddable in surfaces

被引：5
|
作者：
Wang, Huijuan [1 ]
Wu, Jianliang [1 ]
Liu, Bin [2 ]
Chen, Hongyu [3 ]
机构：
[1] Shandong Univ, Sch Math, Jinan 250100, Peoples R China
[2] Ocean Univ China, Dept Math, Qingdao 266100, Peoples R China
[3] Shanghai Inst Technol, Sch Sci, Shanghai 201418, Peoples R China
来源：
INFORMATION PROCESSING LETTERS | 2014年 / 114卷 / 09期
基金：
中国国家自然科学基金;
关键词：
Combinatorial problems; Euler characteristic; Linear arboricity; Embedded graph;
D O I：
10.1016/j.ipl.2014.03.013
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The linear arboricity of a graph G, denoted by la(G), is the minimum number of linear forest required to partition the edge set E(G). Akiyama, Exoo and Harary conjectured that [GRAPHICS] <= la(G) <= [GRAPHICS] for any simple graph G, where Delta is the maximum degree of G. In this paper, it is proved that this conjecture is true for any graph G which can be embedded in a surface of nonnegative Euler characteristic, and furthermore, la(G) = [GRAPHICS] if Delta >= 9. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：475 / 479
页数：5
相关论文
共 50 条
12345