On a list coloring conjecture of Reed
β
Tom Bohman; Ron Holzman
π
Article
π
2002
π
John Wiley and Sons
π
English
β 54 KB
## Abstract 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. Β© 2002 Wiley Periodicals, Inc. J Graph Theory 41: 106β10