Abstract
We study the relation between the correspondence chromatic number and the Alon--Tarsi number, both upper bounds on the list chromatic number of a graph. There are many graphs with Alon--Tarsi number greater than the correspondence chromatic number. We present here a family of graphs with arbitrary Alon--Tarsi number, with correspondence chromatic number one larger. Keywords: correspondence coloring, Alon--Tarsi number AMS Mathematics Subject Classification: 05C15
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.