17 papers
Non-chromatic-adherence of the DP Color Function via Generalized Theta Graphs
Manh Vu Bui, Hemanshu Kaul, Michael Maxfield +3
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 2…
A Deletion-Contraction Relation for the DP Color Function
Jeffrey A. Mudrock
DP-coloring is a generalization of list coloring that was introduced in 2015 by Dvořák and Postle. The chromatic polynomial of a graph , denoted , is equal to the number…
Answers to Two Questions on the DP Color Function
Jeffrey A. Mudrock, Seth Thomason
DP-coloring is a generalization of list coloring that was introduced in 2015 by Dvořák and Postle. The chromatic polynomial of a graph is a notion that has been extensively studied…
Proportional Choosability of Complete Bipartite Graphs
Jeffrey A. Mudrock, Jade Hewitt, Paul Shin +1
Proportional choosability is a list analogue of equitable coloring that was introduced in 2019. The smallest for which a graph is proportionally -choosable is the propor…
Partial DP-Coloring
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer
In 1980, Albertson and Berman introduced partial coloring. In 2000, Albertson, Grossman, and Haas introduced partial list coloring. Here, we initiate the study of partial coloring…
Combinatorial Nullstellensatz and DP-coloring of Graphs
Hemanshu Kaul, Jeffrey A. Mudrock
We initiate the study of applying the Combinatorial Nullstellensatz to the DP-coloring of graphs even though, as is well-known, the Alon-Tarsi theorem does not apply to DP-coloring…