Abstract
We show that for a simple graph , where is the choice index (or edge-list chromatic number) of , and is the maximum degree of . As a simple corollary of this result, we show that the total chromatic number of a simple graph satisfies the inequality and the total choice number also satisfies this inequality. We also relate these bounds to the Hall index and the Hall condition index of a simple graph, and to the total Hall number and the total Hall condition number of a simple graph.
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.