The Linear Arboricity of Planar Graphs with Maximum Degree at Least Five

被引:0
|
作者
Tan, Xiang [1 ,3 ]
Chen, Hongyu [2 ,3 ]
Wu, Jianliang [3 ]
机构
[1] Shandong Univ Finance, Sch Math & Stat, Jinan 250014, Shandong, Peoples R China
[2] Shanghai Inst Technol, Sch Sci, Shanghai 201418, Peoples R China
[3] Shandong Univ, Sch Math, Jinan 250100, Peoples R China
关键词
Planar graph; linear arboricity; cycle; PACKING;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let G be a planar graph with maximum degree Delta >= 5. It is proved that la(G) = inverted right perpendicular Delta(G)/2inverted left perpendicular if (1) any 4-cycle is not adjacent to an i-cycle for any i is an element of {3,4, 5} or (2) G has no intersecting 4-cycles and intersecting i-cycles for some i is an element of {3, 6}.
引用
收藏
页码:541 / 552
页数:12
相关论文
共 50 条
  • [31] An efficient case for computing minimum linear arboricity with small maximum degree
    Wang, Huijuan
    Wu, Lidong
    Pardalos, Miltiades P.
    Du, Hongwei
    Liu, Bin
    OPTIMIZATION LETTERS, 2019, 13 (02) : 419 - 428
  • [32] An efficient case for computing minimum linear arboricity with small maximum degree
    Huijuan Wang
    Lidong Wu
    Miltiades P. Pardalos
    Hongwei Du
    Bin Liu
    Optimization Letters, 2019, 13 : 419 - 428
  • [33] The list linear arboricity of graphs
    Kim, Ringi
    Postle, Luke
    JOURNAL OF GRAPH THEORY, 2021, 98 (01) : 125 - 140
  • [34] EQUITABLE VERTEX ARBORICITY OF PLANAR GRAPHS
    Zhang, Xin
    TAIWANESE JOURNAL OF MATHEMATICS, 2015, 19 (01): : 123 - 131
  • [35] The list linear arboricity of planar graphs with 7-cycles containing at most two chords
    Xu, Renyu
    APPLIED MATHEMATICS AND COMPUTATION, 2019, 363
  • [36] Total Colorings of Planar Graphs with Small Maximum Degree
    Wang, Bing
    Wu, Jian-Liang
    Tian, Si-Feng
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2013, 36 (03) : 783 - 787
  • [37] THE LINEAR 2-ARBORICITY OF PLANAR GRAPHS WITHOUT ADJACENT SHORT CYCLES
    Chen, Hong-Yu
    Tan, Xiang
    Wu, Jian-Liang
    BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY, 2012, 49 (01) : 145 - 154
  • [38] Total coloring of planar graphs with maximum degree 7
    Wang, Bing
    Wu, Jian-Liang
    INFORMATION PROCESSING LETTERS, 2011, 111 (20) : 1019 - 1021
  • [39] The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
    Cheng, Xiaohan
    Wu, Jianliang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (01) : 1 - 13
  • [40] The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
    Xiaohan Cheng
    Jianliang Wu
    Journal of Combinatorial Optimization, 2018, 35 : 1 - 13