Choosability of Toroidal Graphs Without Short Cycles

被引：9
|
作者：
Cai, Leizhen [1 ]
Wang, Weifan [2 ]
Zhu, Xuding [3 ]
机构：
[1] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong, Peoples R China
[2] Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China
[3] Natl Sun Yat Sen Univ, Dept Appl Math, Kaohsiung 804, Taiwan
来源：
JOURNAL OF GRAPH THEORY | 2010年 / 65卷 / 01期
关键词：
choosability; list coloring; toroidal graph; cycle; discharging method; PLANAR GRAPHS; EDGE CHOOSABILITY; THEOREM; TORUS; COLORINGS; SURFACES;
D O I：
10.1002/jgt.20460
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let G be a toroidal graph without cycles of a fixed length k, and xi(G) the list chromatic number of G. We establish tight upper bounds of chi(G) for the following values of k: chi(G)<={4 if k is an element of {3,4,5} 5 if k=6 6 if k=7 (C) 2009 Wiley Periodicals, Inc. J Graph Theory 65: 1-15, 2010
引用
收藏
页码：1 / 15
页数：15
相关论文
共 50 条
  • [41] ACYCLIC 5-CHOOSABILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES
    Borodin, O. V.
    Ivanova, A. O.
    SIBERIAN MATHEMATICAL JOURNAL, 2011, 52 (03) : 411 - 425
  • [42] Structural properties and edge choosability of planar graphs without 4-cycles
    Shen, Yufa
    Zheng, Guoping
    He, Wenjie
    Zhao, Yongqiang
    DISCRETE MATHEMATICS, 2008, 308 (23) : 5789 - 5794
  • [43] Acyclic 4-Choosability of Planar Graphs Without 4-Cycles
    Yingcai Sun
    Min Chen
    Czechoslovak Mathematical Journal, 2020, 70 : 161 - 178
  • [44] Acyclic 4-Choosability of Planar Graphs Without 4-Cycles
    Sun, Yingcai
    Chen, Min
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2020, 70 (01) : 161 - 178
  • [45] Edge-choosability of planar graphs without chordal 7-Cycles
    Cai, Jiansheng
    Ge, Liansheng
    Zhang, Xia
    Liu, Guizhen
    ARS COMBINATORIA, 2011, 100 : 169 - 176
  • [46] Structural properties and edge choosability of planar graphs without 6-cycles
    Weifan, W
    Lih, KW
    COMBINATORICS PROBABILITY & COMPUTING, 2001, 10 (03): : 267 - 276
  • [47] Acyclic 5-choosability of planar graphs without 4-cycles
    Chen, Min
    Wang, Weifan
    DISCRETE MATHEMATICS, 2008, 308 (24) : 6216 - 6225
  • [48] Edge-choosability of planar graphs without chordal 6-Cycles
    Ge, Liansheng
    Cai, Jiansheng
    UTILITAS MATHEMATICA, 2011, 86 : 289 - 296
  • [49] Directed Graphs Without Short Cycles
    Fox, Jacob
    Keevash, Peter
    Sudakov, Benny
    COMBINATORICS PROBABILITY & COMPUTING, 2010, 19 (02): : 285 - 301
  • [50] Bisections of Graphs Without Short Cycles
    Fan, Genghua
    Hou, Jianfeng
    Yu, Xingxing
    COMBINATORICS PROBABILITY & COMPUTING, 2018, 27 (01): : 44 - 59
12345