6 papers · 1 filter
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 the List Color Function Threshold
Hemanshu Kaul, Akash Kumar, Jeffrey A. Mudrock +3
The chromatic polynomial of a graph , denoted , is equal to the number of proper -colorings of . The list color function of graph , denoted , is…
Non-chromatic-adherence of the DP Color Function via Generalized Theta Graphs
Manh Vu Bui, Hemanshu Kaul, Michael Maxfield +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…
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…
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…
Proportional 2-Choosability with a Bounded Palette
Jeffrey A. Mudrock, Robert Piechota, Paul Shin +1
Proportional choosability is a list coloring analogue of equitable coloring. Specifically, a -assignment for a graph specifies a list of available colors to e…