Edge choosability of planar graphs without short cycles

被引：0
|
作者：
WANG Weifan School of Mathematics and Physics
机构：
来源：
Science China Mathematics | 2005年 / 11期
关键词：
planar graph; coloring; choosability; cycle;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
070104 ;
摘要：
In this paper we prove that if G is a planar graph with △= 5 and without 4-cycles or 6-cycles, then G is edge-6-choosable. This consequence together with known results show that, for each fixed k ∈{3,4,5,6}, a k-cycle-free planar graph G is edge-(△+ 1)-choosable, where △ denotes the maximum degree of G.
引用
收藏
页码：1531 / 1544
页数：14
相关论文
共 50 条
  • [21] Acyclic 4-choosability of planar graphs without intersecting short cycles
    Sun, Yingcai
    Chen, Min
    Chen, Dong
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (01)
  • [22] Acyclic 6-choosability of planar graphs without adjacent short cycles
    WeiFan Wang
    Ge Zhang
    Min Chen
    Science China Mathematics, 2014, 57 : 197 - 209
  • [23] Acyclic 4-choosability of planar graphs without adjacent short cycles
    Borodin, Oleg V.
    Ivanova, Anna O.
    DISCRETE MATHEMATICS, 2012, 312 (22) : 3335 - 3341
  • [24] Acyclic 6-choosability of planar graphs without adjacent short cycles
    Wang WeiFan
    Zhang Ge
    Chen Min
    SCIENCE CHINA-MATHEMATICS, 2014, 57 (01) : 197 - 209
  • [25] On (3,1)*-choosability of planar graphs without adjacent short cycles
    Chen, Min
    Raspaud, Andre
    DISCRETE APPLIED MATHEMATICS, 2014, 162 : 159 - 166
  • [26] Choosability of Toroidal Graphs Without Short Cycles
    Cai, Leizhen
    Wang, Weifan
    Zhu, Xuding
    JOURNAL OF GRAPH THEORY, 2010, 65 (01) : 1 - 15
  • [27] Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles
    Borodin, O. V.
    Ivanova, A. O.
    JOURNAL OF GRAPH THEORY, 2011, 68 (02) : 169 - 176
  • [28] Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
    Hou, Jianfeng
    Liu, Guizhen
    Cai, Jiansheng
    DISCRETE MATHEMATICS, 2009, 309 (01) : 77 - 84
  • [29] Choosability with separation of planar graphs without prescribed cycles
    Chen, Min
    Fan, Yingying
    Raspaud, Andre
    Shiu, Wai Chee
    Wang, Weifan
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 367
  • [30] Adaptable choosability of planar graphs with sparse short cycles
    Guan, Albert
    Zhu, Xuding
    DISCRETE MATHEMATICS, 2009, 309 (20) : 6044 - 6047
12345