Abstract
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvořák and Postle [12]. Many known upper bounds for the list-chromatic number extend to the DP-chromatic number, but not all of them do. In this note we describe some properties of DP-coloring that set it aside from list coloring. In particular, we give an example of a planar bipartite graph with DP-chromatic number 4 and prove that the edge-DP-chromatic number of a d-regular graph with d ⩾ 2 is always at least d + 1.
Similar content being viewed by others
References
N. Alon, “Degrees and choice numbers,” Random Struct. Algorithms 16, 364 (2000).
N. Alon and M. Tarsi, “Colorings and orientations of graphs,” Combinatorica 12, 125 (1992).
A. Bernshteyn, “The asymptotic behavior of the correspondence chromatic number,” Discrete Math. 339, 2680 (2016).
A. Bernshteyn, “The Johansson-Molloy theorem for DP-coloring,” Random Struct. Algorithms 54, 653 (2019).
A. Bernshteyn and A. Kostochka, “Sharp Dirac’s theorem for DP-critical graphs,” J. Graph Theory 88, 521 (2018).
A. Yu. Bernshteyn, A. V. Kostochka, and S. P. Pron, “On DP-coloring of graphs and multigraphs,” Sib. Matem. Zh. 58, 36 (2017) [Siberian Math. J. 58, 28 (2017)].
O. V. Borodin, “Colorings of plane graphs: a survey,” Discrete Math. 313, 517 (2013).
O. V. Borodin, A. V. Kostochka, and D. R. Woodall, “List edge and list total colourings of multigraphs,” J. Combin. Theory, Ser. B 71, 184 (1997).
O. V. Borodin, A. V. Kostochka, and D. R. Woodall, “On kernel-perfect orientations of line graphs,” Discrete Math. 191, 45 (1998).
G. A. Dirac, “A theorem of R. L. Brooks and a conjecture of H. Hadwiger,” Proc. London Math. Soc., Ser. III 7, 161 (1957).
G. A. Dirac, “The number of edges in critical graphs,” J. Reine Angew. Math. 268–269, 150 (1974).
Z. Dvořák and L. Postle, “Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8,” J. Combin. Theory, Ser. B 129, 38 (2018).
P. Erdős, A. L. Rubin, and H. Taylor, “Choosability in graphs,” Congr. Numerantium 26, 125 (1980).
F. Galvin, “The list chromatic index of a bipartite multigraph,” J. Combin. Theory, Ser. B 63, 153 (1995).
T. R. Jensen and B. Toft, Graph Coloring Problems John Wiley & Sons, New York, 1995.
A. Johansson, Asymptotic Choice Number for Triangle Free Graphs (unpublished manuscript, 1996).
A. V. Kostochka and M. Stiebitz, “A list version of Dirac’s theorem on the number of edges in colour-critical graphs,” J. Graph Theory 39, 165 (2002).
M. Molloy, “The list chromatic number of graphs with small clique number,” J. Combin. Theory, Ser. B 134, 264 (2019).
C. E. Shannon, “A theorem on coloring the lines of a network,” J. Math. Phys. 28, 148 (1949).
C. Thomassen, “Every planar graph is 5-choosable,” J. Combin. Theory, Ser. B 62, 180 (1994).
C. Thomassen, “3-List-coloring planar graphs of girth 5,” J. Combin. Theory, Ser. B 64, 101 (1995).
V. G. Vizing, “On an estimate of the chromatic class of a p-graph,” Diskret. Anal. 3, 25 (1964) [in Russian].
V. G. Vizing, “Coloring the vertices of a graph in prescribed colors,” Metody Diskret. Anal. 29, 3 (1976) [in Russian].
Acknowledgments
The authors are grateful to the anonymous referee for her/his valuable comments.
Funding
The work of the first author was partially supported by the Illinois Distinguished Fellowship. The work of the second author was partially supported by the Russian Foundation for Basic Research (projects 18-01-00353 and 16-01-00499) and by the National Science Foundation (project DMS-1600592).
Author information
Authors and Affiliations
Corresponding authors
Additional information
Russian Text © The Author(s), 2018, published in Matematicheskie Trudy, 2018, Vol. 21, No. 2, pp. 61–71.
About this article
Cite this article
Bernshteyn, A.Y., Kostochka, A.V. On Differences Between DP-Coloring and List Coloring. Sib. Adv. Math. 29, 183–189 (2019). https://doi.org/10.3103/S1055134419030039
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1055134419030039