The choice number of a graph G, denoted by xl(G), is the minimum number k such that if we give lists of k colors to each vertex of G, there is a vertex coloring of G where each vertex receives a color from its own list no matter what the lists are. In this paper, we show that xl (G) ≤ 3 for each plane graph of girth no less than 4 which contains no 5-, 8- and 9-cycles.%图G的选色数,记为xl(G),定义为最小的自然数k,使得满足对任一顶点给定k种颜色的列表,且染色时每个顶点的颜色只能从自身的列表中选择时,总存在图G的一个顶点的正常着色.证明了每个围长至少为4且不含5-圈,8-圈和9-圈的平面图是3-选色的.
展开▼
