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 条
  • [31] 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
  • [32] Edge-(k, l)-Choosability of Planar Graphs without 4-Cycles
    Zheng, Guoping
    Shen, Yufa
    Wang, Jinran
    Gao, Mingjing
    [J]. PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 2009, 8 : 878 - 880
  • [33] A Note on Edge-Group Choosability of Planar Graphs without 5-Cycles
    Khamseh, Amir
    [J]. JOURNAL OF MATHEMATICS, 2020, 2020
  • [34] 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
  • [35] Acyclic edge colouring of planar graphs without short cycles
    Borowiecki, Mieczyslaw
    Fiedorowicz, Anna
    [J]. DISCRETE MATHEMATICS, 2010, 310 (09) : 1445 - 1455
  • [36] Acyclic Edge Colorings of Planar Graphs Without Short Cycles
    Sun, Xiang-Yong
    Wu, Han-Liang
    [J]. OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2008, 8 : 325 - +
  • [37] On 3-choosability of planar graphs without certain cycles
    Zhang, Haihui
    Sun, Zhiren
    [J]. INFORMATION PROCESSING LETTERS, 2008, 107 (3-4) : 102 - 106
  • [38] IMPROPER CHOOSABILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES
    Wang, Yingqian
    Xu, Lingji
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (04) : 2029 - 2037
  • [39] Edge-choosability of planar graphs without non-induced 5-cycles
    Cai, Jiansheng
    Hou, Jianfeng
    Zhang, Xia
    Liu, Guizhen
    [J]. INFORMATION PROCESSING LETTERS, 2009, 109 (07) : 343 - 346
  • [40] Acyclic 5-choosability of planar graphs without small cycles
    Montassier, Mickael
    Raspaud, Andre
    Wang, Weifan
    [J]. JOURNAL OF GRAPH THEORY, 2007, 54 (03) : 245 - 260
12345