5 papers
Covering Families for DP-Coloring of Cartesian Products with Complete Bipartite Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Emily A. Psyhogios +3
A famous folklore result in list coloring demonstrating that the gap between the list chromatic number and chromatic number of a graph can be arbitrarily large is: $χ_{\ell}(K_{l,t…
The DP Color Function of Bipartite Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma +1
DP-coloring (or correspondence coloring) is a generalization of list coloring that has been widely studied since its introduction by Dvořák and Postle in 2015. As the analogue of $…
On the DP-chromatic Number of Cartesian Products of Critical Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma
DP-coloring (also called correspondence coloring) is a well-studied generalization of list coloring introduced by Dvořák and Postle in 2015. The following sharp bound on the DP-chr…
Shameful Inequalities for List and DP Coloring of Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma
The chromatic polynomial of a graph is an important notion in algebraic combinatorics that was introduced by Birkhoff in 1912; denoted , it equals the number of proper -…
On strongly and robustly critical graphs
Anton Bernshteyn, Hemanshu Kaul, Jeffrey A. Mudrock +1
In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list-critical graphs occupy a promin…