2 citations · 4 across the 34 of their papers we have counts for
7 papers · 1 filter
On Polynomial Representations of the DP Color Function: Theta Graphs and Their Generalizations
Charlie Halberg, Hemanshu Kaul, Andrew Liu +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…
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…
On Equitable List Arboricity of Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer
Equitable list arboricity, introduced by Zhang in 2016, generalizes the notion of equitable list coloring by requiring the subgraph induced by each color class to be acyclic (inste…
On the Equitable Choosability of the Disjoint Union of Stars
Hemanshu Kaul, Jeffrey A. Mudrock, Tim Wagstrom
Equitable -choosability is a list analogue of equitable -coloring that was introduced by Kostochka, Pelsmajer, and West in 2003. It is known that if vertex disjoint graphs $G…
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…