王维凡
professor
Gender : Male
Alma Mater : 南京大学
Education Level : Graduate student graduate
Degree : Doctorate
Status : 退休
School/Department : 数学科学学院
Date of Employment : 2002-05-01
Hits :
First Author : Dai-Qiang Hu
Affiliation of Author(s): 数理与信息工程学院
Date of Publication : 2018-01-01
Document Type : 期刊
Journal : Discrete Applied Mathematics
Volume: Vol.244
Page Number : 116-123
ISSN : 0166-218X
Translation or Not : no
Key Words : List;coloring;Planar;graph;Cycle;Chord
Abstract : A graph G is k -choosable if it can be colored whenever every vertex has a list of at least k available colors. In this paper, we prove that every planar graph without chordal 6-cycles is 4-choosable. This extends a known result that every planar graph wi
