2 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
6 papers
Bounding the List Color Function Threshold from Above
Hemanshu Kaul, Akash Kumar, Andrew Liu +5
The chromatic polynomial of a graph , denoted , is equal to the number of proper -colorings of for each . In 1990, Kostochka and Sidorenko intro…
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…
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…
A Note on Fractional DP-Coloring of Graphs
Daniel Dominik, Hemanshu Kaul, Jeffrey A. Mudrock
DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by Dvořák and Postle in 2015. In 2019, Bernshteyn, Kostochka, and Zhu introduced a…
On the Chromatic Polynomial and Counting DP-Colorings
Hemanshu Kaul, Jeffrey A. Mudrock
The chromatic polynomial of a graph , denoted , is equal to the number of proper -colorings of . The list color function of graph , denoted , is…
A Note on the Equitable Choosability of Complete Bipartite Graphs
Jeffrey A. Mudrock, Madelynn Chase, Isaac Kadera +2
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A -assignment, , for a graph assigns a list, …