The chromatic polynomial and list colorings

7Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

We prove that, if a graph has a list of k available colors at every vertex, then the number of list-colorings is at least the chromatic polynomial evaluated at k when k is sufficiently large compared to the number of vertices of the graph. © 2008 Elsevier Inc. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Thomassen, C. (2009). The chromatic polynomial and list colorings. Journal of Combinatorial Theory. Series B, 99(2), 474–479. https://doi.org/10.1016/j.jctb.2008.09.005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free