Elsevier

European Journal of Combinatorics

Volume 65, October 2017, Pages 122-129
European Journal of Combinatorics

DP-colorings of graphs with high chromatic number

https://doi.org/10.1016/j.ejc.2017.05.007Get rights and content
Under an Elsevier user license
open archive

Abstract

DP-coloring is a generalization of list coloring introduced recently by Dvořák and Postle (2015). We prove that for every n-vertex graph G whose chromatic number χ(G) is “close” to n, the DP-chromatic number of G equals χ(G). “Close” here means χ(G)nO(n), and we also show that this lower bound is best possible (up to the constant factor in front of n), in contrast to the case of list coloring.

Cited by (0)