Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8902835 | Discrete Mathematics | 2018 | 4 Pages |
Abstract
DP-coloring (also called correspondence coloring) is a generalization of list coloring recently introduced by DvoÅák and Postle. Several known bounds for the list chromatic number of a graph G, Ïâ(G), also hold for the DP-chromatic number of G, ÏDP(G). On the other hand, there are several properties of the DP-chromatic number that show that it differs with the list chromatic number. In this note we show one such property. It is well known that Ïâ(Kk,t)=k+1 if and only if tâ¥kk. We show that ÏDP(Kk,t)=k+1 if tâ¥1+(kkâk!)(log(k!)+1), and we show that ÏDP(Kk,t)
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jeffrey A. Mudrock,