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 条
  • [31] The Linear Arboricity of Planar Graphs without 5-Cycles with Chords
    Chen, Hong-Yu
    Tan, Xiang
    Wu, Jian-Liang
    [J]. BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2013, 36 (02) : 285 - 290
  • [32] Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
    Liu, Runrun
    Li, Xiangwen
    [J]. DISCRETE MATHEMATICS, 2019, 342 (03) : 623 - 627
  • [33] Total Colorings of Planar Graphs with Maximum Degree Seven and without 3-Cycles Adjacent to 5-Cycles
    Liu, Guangde
    Wang, Bing
    Wu, Jian-liang
    [J]. FOUNDATIONS OF INTELLIGENT SYSTEMS (ISKE 2011), 2011, 122 : 335 - +
  • [34] Every Planar Graph Without 4-Cycles and 5-Cycles is (2,6)-Colorable
    Liu, Jie
    Lv, Jian-Bo
    [J]. BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2020, 43 (03) : 2493 - 2507
  • [35] The Linear Arboricity of Planar Graphs without chordal short cycles
    Wang, Hui-Juan
    Liu, Bin
    Wu, Jian-Liang
    [J]. UTILITAS MATHEMATICA, 2012, 87 : 255 - 263
  • [36] Planar graphs without 4-cycles adjacent to triangles are 4-choosable
    Cheng, Panpan
    Chen, Min
    Wang, Yingqian
    [J]. DISCRETE MATHEMATICS, 2016, 339 (12) : 3052 - 3057
  • [37] The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
    Sun, Lin
    Cheng, Xiaohan
    Wu, Jianliang
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (02) : 779 - 790
  • [38] The Linear Arboricity of Planar Graphs without 5-cycles and 6-cycles
    Tan, Xiang
    Chen, Hong-Yu
    Wu, Jian-Liang
    [J]. ARS COMBINATORIA, 2010, 97A : 367 - 375
  • [39] Acyclic edge coloring of planar graphs without 4-cycles
    Wang, Weifan
    Shu, Qiaojun
    Wang, Yiqiao
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (04) : 562 - 586
  • [40] Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
    Huang, Ziwen
    Liu, Runrun
    Wang, Gaozhen
    [J]. DISCRETE APPLIED MATHEMATICS, 2019, 268 : 112 - 118
12345