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 条
12345