On the Linear 2-Arboricity of Planar Graphs without Intersecting 3-Cycles or Intersecting 4-Cycles

被引：0
|
作者：
Xu, Changqing [1 ,2 ]
Zhao, Zongzheng [1 ,3 ]
Yao, Mei [1 ]
机构：
[1] Hebei Univ Technol, Dept Appl Math, Tianjin 300401, Peoples R China
[2] Hebei Prov Key Lab Big Data Calculat, Tianjin 300401, Peoples R China
[3] Tianjin Univ, Renai Coll, Dept Math, Tianjin 301636, Peoples R China
来源：
ARS COMBINATORIA | 2018年 / 136卷
关键词：
planar graph; linear arboricity; linear; 2-arboricity;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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 component trees are paths of length at most 2. Two cycles are intersecting if they have at least one common vertex. Let G be a simple planar graph with maximum degree Delta. We prove that la(2)(G) <= inverted right perpendicular Delta/2inverted left perpendicular +6 if G has no intersecting 3-cycles or no intersecting 4-cycles.
引用
收藏
页码：383 / 389
页数：7
相关论文
共 50 条
12345