Abstract
Let denote the choice number of a graph (also called "list chromatic number" or "choosability" of ). Noel, Reed, and Wu proved the conjecture of Ohba that when . We extend this to a general upper bound: . Our result is sharp for using Ohba's examples, and it improves the best-known upper bound for .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.