共查询到20条相似文献，搜索用时 17 毫秒
1.
2.
3.
4.
5.
6.
7.
《Ukrainian Mathematical Journal》2000,52(12):1967-1969
8.
10.
《Ukrainian Mathematical Journal》2000,52(12):1971-1980
11.
12.
13.
ON 3-CHOOSABILITY OF PLANE GRAPHS WITHOUT 6-,7- AND 9-CYCLES 总被引：2，自引：0，他引：2
ZhangHaihui XuBaogang 《高校应用数学学报(英文版)》2004,19(1):109-115
The choice number of a graph G,denoted by X1(G),is the minimum number k such that if a list of k colors is given 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,it is showed that X1 (G)≤3 for each plane graph of girth not less than 4 which contains no 6-, 7- and 9-cycles. 相似文献
14.
15.
16.
17.
18.
19.