Edge-choosability of planar graphs without chordal 6-Cycles

被引:0
作者
Ge, Liansheng [2 ]
Cai, Jiansheng [1 ]
机构
[1] Weifang Univ, Sch Math & Informat Sci, Weifang 261061, Peoples R China
[2] Shandong Univ, Sch Comp Sci & Technol, Jinan 250100, Peoples R China
关键词
planar graph; edge-coloring; choosability; cycle; chord; combinatorial problem; LIST TOTAL COLORINGS;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A graph G is edge-L-colorable, if for a given edge assignment L = {L(e) : e is an element of E(G)}, there exits a proper edge-coloring phi of G such that phi(e) is an element of L(e) for all e is an element of E(G). If G is edge-L-colorable for every edge assignment L with vertical bar L(e)vertical bar >= k for e is an element of E(G), then G is said to be edge-k-choosable. In this paper, we prove that if G is a planar graph without chordal 6-cycles, then G is edge-k-choosable, where k = max{8, Delta(G) + 1}.
引用
收藏
页码:289 / 296
页数:8
相关论文
共 23 条
  • [11] Jensen T., 1995, Graph Coloring Problems, P115
  • [12] Juvan M, 1999, J GRAPH THEOR, V32, P250, DOI 10.1002/(SICI)1097-0118(199911)32:3<250::AID-JGT5>3.3.CO
  • [13] 2-I
  • [14] LIST EDGE CHROMATIC NUMBER OF GRAPHS WITH LARGE GIRTH
    KOSTOCHKA, AV
    [J]. DISCRETE MATHEMATICS, 1992, 101 (1-3) : 189 - 201
  • [15] List edge and list total colorings of planar graphs without short cycles
    Liu, Bin
    Hou, Jianfeng
    Liu, Guizhen
    [J]. INFORMATION PROCESSING LETTERS, 2008, 108 (06) : 347 - 351
  • [16] 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
  • [17] Choosability and edge choosability of planar graphs without five cycles
    Wang, WF
    Lih, KW
    [J]. APPLIED MATHEMATICS LETTERS, 2002, 15 (05) : 561 - 565
  • [18] Choosability and edge choosability of planar graphs without intersecting triangles
    Wang, WF
    Lih, KW
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2002, 15 (04) : 538 - 545
  • [19] Wang WF, 2001, EUR J COMBIN, V22, P71
  • [20] Edge-choosability of multicircuits
    Woodall, DR
    [J]. DISCRETE MATHEMATICS, 1999, 202 (1-3) : 271 - 277