Related papers: A Deletion-Contraction Relation for the DP Color F…

DP-coloring (also called correspondence coloring) is a generalization of list coloring that was introduced by Dvo\v{r}\'{a}k and Postle in 2015. The chromatic polynomial of a graph is an important notion in algebraic combinatorics that was…

The chromatic polynomial of a graph $G$, denoted $P(G,m)$, is equal to the number of proper $m$-colorings of $G$. The list color function of graph $G$, denoted $P_{\ell}(G,m)$, is a list analogue of the chromatic polynomial that has been…

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\v{r}\'{a}k and Postle in 2015. As the analogue of the chromatic polynomial…

DP-coloring is a generalization of list coloring that was introduced in 2015 by Dvo\v{r}\'{a}k and Postle. The chromatic polynomial of a graph is a notion that has been extensively studied since the early 20th century. The chromatic…

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\v{r}\'{a}k and Postle in 2015. As the analogue of the chromatic polynomial of…

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\v{r}\'{a}k and Postle in 2015. As the analogue of the chromatic polynomial…

DP-coloring (or correspondence coloring) is a generalization of list coloring that has been widely studied since its introduction by Dvo\v{r}\'{a}k and Postle in 2015. As the analogue of the chromatic polynomial of a graph $G$, $P(G,m)$,…

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\v{r}\'{a}k and Postle in 2015. The chromatic polynomial of a graph is an…

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…

The DP-coloring is a generalization of the list coloring, introduced by Dvo\v{r}\'{a}k and Postle. Let $\mathcal{H}=(L,H)$ be a cover of a graph $G$ and $P_{DP}(G,\mathcal{H})$ be the number of $\mathcal{H}$-colorings of $G$. The DP color…

DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by Dvo\v{r}\'{a}k and Postle in 2015. Motivated by results related to list coloring Cartesian products of graphs, we initiate the study of the…

DP-coloring is a generalization of list coloring introduced recently by Dvo\v{r}\'ak and Postle. We prove that for every $n$-vertex graph $G$ whose chromatic number $\chi(G)$ is "close" to $n$, the DP-chromatic number of $G$ equals…

While solving a question on list coloring of planar graphs, Dvo\v{r}\'{a}k and Postle introduced the new notion of DP-coloring (they called it correspondence coloring). A DP-coloring of a graph $G$ reduces the problem of finding a coloring…

DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by Dvo\v{r}\'{a}k and Postle in 2015. The DP-chromatic number of a graph $G$, $\chi_{_{DP}}(G)$, is the analogue of the chromatic number of…

DP-coloring (also called correspondence coloring) is a well-studied generalization of list coloring introduced by Dvo\v{r}\'{a}k and Postle in 2015. The following sharp bound on the DP-chromatic number of the Cartesian product of graphs $G$…

DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by Dvo\v{r}\'{a}k and Postle in 2015. In 2019, Bernshteyn, Kostochka, and Zhu introduced a fractional version of DP-coloring. They showed that…

The chromatic polynomial of a graph $G$, denoted $P(G,m)$, is equal to the number of proper $m$-colorings of $G$ for each $m \in \mathbb{N}$. In 1990, Kostochka and Sidorenko introduced the list color function of graph $G$, denoted…

DP-coloring (also called correspondence coloring) of graphs is a generalization of list coloring that has been widely studied since its introduction by Dvo\v{r}\'{a}k and Postle in $2015$. Intuitively, DP-coloring generalizes list coloring…

In this article, we introduce the DP color function of a hypergraph, based on the DP coloring introduced by Bernshteyn and Kostochka, which is the minimum value where the minimum is taken over all its k-fold covers. It is an extension of…

The chromatic polynomial of a graph is an important notion in algebraic combinatorics that was introduced by Birkhoff in 1912; denoted $P(G,k)$, it equals the number of proper $k$-colorings of graph $G$. Enumerative analogues of the…