3 papers
math.CO2026
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 $…
math.CO2025
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…
math.CO2024
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 -…