王维凡
professor
Gender : Male
Alma Mater : 南京大学
Education Level : Graduate student graduate
Degree : Doctorate
Status : 退休
School/Department : 数学科学学院
Date of Employment : 2002-05-01
Hits :
First Author : Leizhen Cai
Affiliation of Author(s): 数理与信息工程学院
Date of Publication : 2010-01-01
Document Type : 期刊
Journal : Journal of Graph Theory
Volume: Vol.65
Issue : No.1
Page Number : 1-15
Translation or Not : no
Key Words : choosability;list;coloring;toroidal;graph;cycle;discharging;method
Abstract : 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 of χ l (G) for the following values of k:
