2 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2022
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…
math.CO2020★ 2 cited
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…