A Deletion–Contraction Relation for the DP Color Function

DP-coloring is a generalization of list coloring that was introduced in 2015 by Dvořák and Postle. The chromatic polynomial of a graph G, denoted P (G,m), is equal to the number of proper m-colorings of G. A well-known tool for computing the chromatic polynomial of graph G is the deletion-contraction formula which relates P (G,m) to the chromatic polynomials of two smaller graphs. The DP color function of a graph G, denoted PDP (G,m), is a DP-coloring analogue of the chromatic polynomial, and PDP (G,m) is the minimum number of DP-colorings of G over all possible m-fold covers. In this paper we present a deletion-contraction relation for the DP color function. To make this possible, we extend the definition of the DP color function to multigraphs. We also introduce the dual DP color function of a graph G, denoted P ∗ DP (G,m), which counts the maximum number of DP-colorings of G over certain m-fold covers. We show how the dual DP color function along with our deletion-contraction relation yields a new general lower bound on the DP color function of a graph.

[1]  Jeffrey A. Mudrock.  A note on the DP-chromatic number of complete bipartite graphs , 2018, Discret. Math..

[2]  Alexandr Kostochka,et al.  On DP-coloring of graphs and multigraphs , 2016 .

[3]  Yan Yang,et al.  Compare DP color functions with chromatic polynomials , 2021, 2105.11081.

[4]  Quentin Donner,et al.  On the number of list-colorings , 1992, J. Graph Theory.

[5]  Jeffrey A. Mudrock,et al.  Answers to Two Questions on the DP Color Function , 2020, Electron. J. Comb..

[6]  W. T. Tutte,et al.  The Dissection of Rectangles Into Squares , 1940 .

[7]  Luke Postle,et al.  Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 , 2015, J. Comb. Theory B.

[8]  Xiangwen Li,et al.  Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable , 2019, Discret. Math..

[9]  Seog-Jin Kim,et al.  A note on a Brooks' type theorem for DP‐coloring , 2017, J. Graph Theory.

[10]  Gexin Yu,et al.  DP-3-coloring of some planar graphs , 2018, Discret. Math..

[11]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[12]  Michael Molloy,et al.  Asymptotically good edge correspondence colouring , 2018, 1808.08594.

[13]  G. Birkhoff.  A Determinant Formula for the Number of Ways of Coloring a Map , 1912 .

[14]  Anton Bernshteyn,et al.  The Johansson‐Molloy theorem for DP‐coloring , 2017, Random Struct. Algorithms.

[15]  Hemanshu Kaul,et al.  Combinatorial Nullstellensatz and DP-coloring of graphs , 2020, Discret. Math..

[16]  Hemanshu Kaul,et al.  The DP Color Function of Joins and Vertex-Gluings of Graphs , 2021 .

[17]  Alexandr V. Kostochka,et al.  Sharp Dirac's theorem for DP‐critical graphs , 2016, J. Graph Theory.

[18]  Ramin Naimi,et al.  List Coloring And n-Monophilic Graphs , 2010, Ars Comb..

[19]  Hemanshu Kaul,et al.  DP-Coloring Cartesian Products of Graphs , 2021 .

[20]  Carsten Thomassen,et al.  The chromatic polynomial and list colorings , 2009, J. Comb. Theory, Ser. B.

[21]  Wei Wang,et al.  When does the list-coloring function of a graph equal its chromatic polynomial , 2017, J. Comb. Theory, Ser. B.

[22]  Hemanshu Kaul,et al.  On the Chromatic Polynomial and Counting DP-Colorings , 2019, Adv. Appl. Math..

[23]  Jeffrey A. Mudrock,et al.  On Polynomial Representations of the DP Color Function: Theta Graphs and Their Generalizations , 2020, 2012.12897.