The DP Color Function of Joins and Vertex-Gluings of Graphs

DP-coloring (also called correspondence coloring) is a generalization of list coloring that has been widely studied in recent years after its introduction by Dvořák and Postle in 2015. As the analogue of the chromatic polynomial P (G,m), the DP color function of a graph G, denoted PDP (G,m), counts the minimum number of DP-colorings over all possible m-fold covers. Chromatic polynomials for joins and vertex-gluings of graphs are well understood, but the effect of these graph operations on the DP color function is not known. In this paper we make progress on understanding the DP color function of the join of a graph with a complete graph and vertex-gluings of certain graphs. We also develop tools to study the DP color function under these graph operations, and we study the threshold (smallest m) beyond which the DP color function of a graph constructed with these operations equals its chromatic polynomial.

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

[2]  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.

[3]  H. Whitney.  A logical expansion in mathematics , 1932 .

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

[5]  Ruth Haas,et al.  Classifying coloring graphs , 2016, Discret. Math..

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

[7]  Anton Bernshteyn,et al.  The asymptotic behavior of the correspondence chromatic number , 2016, Discret. Math..

[8]  Alexandr Kostochka,et al.  On Differences Between DP-Coloring and List Coloring , 2017, Siberian Advances in Mathematics.

[9]  K. Koh,et al.  Chromatic polynomials and chro-maticity of graphs , 2005 .

[10]  Noga Alon,et al.  Colorings and orientations of graphs , 1992, Comb..

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

[12]  Alexandr V. Kostochka,et al.  DP-colorings of graphs with high chromatic number , 2017, Eur. J. Comb..

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

[14]  Paulette Singley.  Criticality , 2019, How to Read Architecture.

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

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

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

[18]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

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

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

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

[22]  Seog-Jin Kim,et al.  A sufficient condition for DP-4-colorability , 2017, Discret. Math..

[23]  Jeffrey A. Mudrock,et al.  Criticality, the list color function, and list coloring the cartesian product of graphs , 2018, Journal of Combinatorics.

[24]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[25]  Michael Molloy,et al.  The list chromatic number of graphs with small clique number , 2017, J. Comb. Theory B.

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

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

[28]  Noga Alon,et al.  Degrees and choice numbers , 2000, Random Struct. Algorithms.

[29]  G. Dirac.  On rigid circuit graphs , 1961 .