DP color functions versus chromatic polynomials
Fengming Dong, Yang, Yan · arXiv (Cornell University) · 2021
For any graph $G$, the chromatic polynomial of $G$ is the function $P(G,m)$ which counts the number of proper $m$-colorings of $G$ for each positive integer $m$. The DP color function $P_{DP}(G,m)$ of $G$, introduced by Kaul and Mudrock in 2019, is a generalization of $P(G,m)$ with $P_{DP}(G,m)\le P(G,m)$ for each positive integer $m$. Let $P_{DP}(G)\approx P(G)$ (resp. $P_{DP}(G)< P(G)$) denote the property that $P_{DP}(G,m)=P(G,m)$ (resp. $P_{DP}(G,m)