LIST COLORING OF COMPLETE MULTIPARTITE GRAPHS

被引：2
|
作者：
Vetrik, Tomas [1 ]
机构：
[1] Univ KwaZulu Natal, Sch Math Sci, Durban, South Africa
来源：
DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2012年 / 32卷 / 01期
关键词：
list coloring; choice number; complete multipartite graph;
D O I：
10.7151/dmgt.1583
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The choice number of a graph G is the smallest integer k such that for every assignment of a list L(v) of k colors to each vertex v of G, there is a proper coloring of G that assigns to each vertex v a color from L(v). We present upper and lower bounds on the choice number of complete multipartite graphs with partite classes of equal sizes and complete r-partite graphs with r - 1 partite classes of order two.
引用
收藏
页码：31 / 37
页数：7
相关论文
共 50 条
12345