Choosability of toroidal graphs without short cycles

: Let G be a toroidal graph without cycles of a fixed length k, and l(G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant number: CUHK4165/01E (to L. C.); Contract grant sponsor: NSFC; Contract grant number: 10771197 (to W. W.); Contract grant sponsor: ZJNSFC; Contract grant number: Z6090150 (to W. W.); Contract grant sponsor: NSC97-2115-M-110-008-MY3 (to X. Z.). Journal of Graph Theory ᭧ 2009 Wiley Periodicals, Inc. 1 

• Type: Journal
• Year: 2010
• Where: JGT
• Authors: Leizhen Cai, Weifan Wang, Xuding Zhu
• Keywords: Contract Grant, JGT 2010, List Chromatic Number, Tight Upper Bounds