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
来源：
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY | 2011年 / 34卷 / 03期
关键词：
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 条
  • [41] Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
    Chang, Yulin
    Ouyang, Qiancheng
    Wang, Guanghui
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (01) : 185 - 196
  • [42] Total coloring of planar graphs with maximum degree 8
    Wang, Huijuan
    Wu, Lidong
    Wu, Jianliang
    THEORETICAL COMPUTER SCIENCE, 2014, 522 : 54 - 61
  • [43] Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
    Yulin Chang
    Qiancheng Ouyang
    Guanghui Wang
    Journal of Combinatorial Optimization, 2019, 38 : 185 - 196
  • [44] The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
    Cheng, Xiaohan
    Wang, Bin
    Wang, Jihui
    DISCRETE APPLIED MATHEMATICS, 2022, 313 : 29 - 39
  • [45] NEIGHBOR PRODUCT DISTINGUISHING TOTAL COLORINGS OF PLANAR GRAPHS WITH MAXIMUM DEGREE AT LEAST TEN
    Dong, Aijun
    Li, Tong
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021, 41 (04) : 981 - 999
  • [46] RECOLORING PLANAR GRAPHS OF GIRTH AT LEAST FIVE
    Bartier, Valentin
    Bousquet, Nicolas
    Feghali, Carl
    Heinrich, Marc
    Moore, Benjamin
    Pierron, Theo
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (01) : 332 - 350
  • [47] An improved upper bound on the linear 2-arboricity of planar graphs
    Wang, Yiqiao
    DISCRETE MATHEMATICS, 2016, 339 (01) : 39 - 45
  • [48] The vertex linear arboricity of claw-free graphs with small degree
    Wu, Jian-Liang
    Wu, Yu-Liang
    ARS COMBINATORIA, 2008, 86 : 289 - 293
  • [49] Linear arboricity and linear k-arboricity of regular graphs
    Alon, N
    Teague, VJ
    Wormald, NC
    GRAPHS AND COMBINATORICS, 2001, 17 (01) : 11 - 16
  • [50] Linear Arboricity and Linear k-Arboricity of Regular Graphs
    Noga Alon
    V. J. Teague
    N. C. Wormald
    Graphs and Combinatorics, 2001, 17 : 11 - 16
12345