Edge-(k, l)-Choosability of Planar Graphs without 4-Cycles

被引:0
|
作者
Zheng, Guoping [1 ]
Shen, Yufa [1 ]
Wang, Jinran [1 ]
Gao, Mingjing [1 ]
机构
[1] Hebei Normal Univ Sci & Technol, Dept Math & Phys, Qinhuangdao 066004, Peoples R China
关键词
List coloring; planar graphs; cycles; (k; l)-edge-choosability; CHOOSABILITY;
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
Aiming at the conjecture of Erdos, Rubin and Taylor for (k, l)-choosability, in this paper we show that if a planar graph G without 4-cycles and Delta(G) not equal 4, then G is edge-((Delta(G) + 1)m, m)-choosable for all m >= 1, which extend the result that if a planar graph G without 4-cycles, then G is edge- (Delta(G)+1)-choosable [W.F. Wang, Edge choosability of planar graphs without short cycles, Science in China Ser. A, Mathematics, 48 (11) (2005) 1531-1544, and Y Shen et al., Structural properties and edge choosability of planar graphs without 4-cycles, Discrete Mathematics, 308 (23) 2008 5789-5794] in some way.
引用
收藏
页码:878 / 880
页数:3
相关论文
共 50 条
  • [1] Structural properties and edge choosability of planar graphs without 4-cycles
    Shen, Yufa
    Zheng, Guoping
    He, Wenjie
    Zhao, Yongqiang
    [J]. DISCRETE MATHEMATICS, 2008, 308 (23) : 5789 - 5794
  • [2] IMPROPER CHOOSABILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES
    Wang, Yingqian
    Xu, Lingji
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (04) : 2029 - 2037
  • [3] A note on edge-choosability of planar graphs without intersecting 4-cycles
    Ma Q.
    Wang J.
    Cai J.
    Zhang S.
    [J]. Journal of Applied Mathematics and Computing, 2011, 36 (1-2) : 367 - 372
  • [4] Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
    Li, Rui
    Xu, Baogang
    [J]. DISCRETE MATHEMATICS, 2011, 311 (20) : 2158 - 2163
  • [5] Acyclic 4-Choosability of Planar Graphs Without 4-Cycles
    Sun, Yingcai
    Chen, Min
    [J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 2020, 70 (01) : 161 - 178
  • [6] Acyclic 4-Choosability of Planar Graphs Without 4-Cycles
    Yingcai Sun
    Min Chen
    [J]. Czechoslovak Mathematical Journal, 2020, 70 : 161 - 178
  • [7] ACYCLIC 5-CHOOSABILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES
    Borodin, O. V.
    Ivanova, A. O.
    [J]. SIBERIAN MATHEMATICAL JOURNAL, 2011, 52 (03) : 411 - 425
  • [8] Acyclic 5-choosability of planar graphs without 4-cycles
    Borodin O.V.
    Ivanova A.O.
    [J]. Siberian Mathematical Journal, 2011, 52 (3) : 411 - 425
  • [9] Acyclic 5-choosability of planar graphs without 4-cycles
    Chen, Min
    Wang, Weifan
    [J]. DISCRETE MATHEMATICS, 2008, 308 (24) : 6216 - 6225
  • [10] Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
    Wang, Jihui
    Cai, Jiansheng
    Ma, Qiaoling
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 206 : 215 - 219