On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles

被引：2
|
作者：
Wang, Yiqiao [1 ]
机构：
[1] Beijing Univ Chinese Med, Sch Management, Beijing, Peoples R China
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 2017年 / 94卷 / 05期
基金：
中国国家自然科学基金;
关键词：
Planar graph; linear; 2-arboricity; maximum degree; cycle; K-ARBORICITY;
D O I：
10.1080/00207160.2016.1158813
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The linear 2-arboricity la(2)(G) of a graph G is the least integer k such that G can be partitioned into k edge-disjoint forests, whose components are paths of length at most 2. In this paper, we prove that if G is a planar graph in which there do not exist a 3-cycle and a 4-cycle sharing exactly one common edge, then la(2)(G) <= [Delta(G)/2] + 5. This improves some currently known results.
引用
收藏
页码：981 / 988
页数：8
相关论文
共 50 条
12345