Add to ORKGDP-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 $P(G,m)$, the DP color function of a graph $G$, denoted $P_{DP}(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 functi...
The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural n...
We define signable, generalized signable, and $Z$-signable correspondence assignments on multigraphs...
For a simple graph G, let P(G?) be the chromatic polynomial of G. Two graphs G and H are said to be ...
DP-coloring (or correspondence coloring) is a generalization of list coloring that has been widely s...
DP-coloring (also called correspondence coloring) is a generalization of list coloring that has been...
DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by...
In the early 20th century the chromatic polynomial was introduced as a way to\ud count the proper co...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has develo...
summary:For a nontrivial connected graph $G$, let $c\: V(G)\to \Bbb N$ be a vertex coloring of $G$...
A thesis submitted in fulfilment of the requirements for the degree of Master of Science, 2018In thi...
DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed r...
The function that counts the number of proper colorings of a graph is the chromatic\ud polynomial. S...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
The DP-coloring problem is a generalization of the list-coloring problem in which the goal is to fin...
This dissertation proves a collection of results in some heterogeneous generalizations of vertex col...
The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural n...
We define signable, generalized signable, and $Z$-signable correspondence assignments on multigraphs...
For a simple graph G, let P(G?) be the chromatic polynomial of G. Two graphs G and H are said to be ...
DP-coloring (or correspondence coloring) is a generalization of list coloring that has been widely s...
DP-coloring (also called correspondence coloring) is a generalization of list coloring that has been...
DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by...
In the early 20th century the chromatic polynomial was introduced as a way to\ud count the proper co...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has develo...
summary:For a nontrivial connected graph $G$, let $c\: V(G)\to \Bbb N$ be a vertex coloring of $G$...
A thesis submitted in fulfilment of the requirements for the degree of Master of Science, 2018In thi...
DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed r...
The function that counts the number of proper colorings of a graph is the chromatic\ud polynomial. S...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
The DP-coloring problem is a generalization of the list-coloring problem in which the goal is to fin...
This dissertation proves a collection of results in some heterogeneous generalizations of vertex col...
The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural n...
We define signable, generalized signable, and $Z$-signable correspondence assignments on multigraphs...
For a simple graph G, let P(G?) be the chromatic polynomial of G. Two graphs G and H are said to be ...