On a list coloring conjecture of Reed

被引：15

作者：

Bohman, T ^{[1
]}

Holzman, R

机构：

[1] Technion Israel Inst Technol, Dept Math, IL-32000 Haifa, Israel

[2] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA

来源：

JOURNAL OF GRAPH THEORY | 2002年 / 41卷 / 02期

关键词：

list coloring; choosability; vetrtex-color degree;

D O I：

10.1002/jgt.10054

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We construct graphs with lists of available colors for each vertex, such that the size of every list exceeds the maximum vertex-color degree, but there exists no proper coloring from the lists. This disproves a conjecture of Reed. (C) 2002 Wiley Periodicals, Inc.

引用

页码：106 / 109

页数：4