15 papers
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…
The unlabeled list color function of disconnected graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Armin Straub
Given a graph , its chromatic polynomial counts proper -colorings, while the corresponding list color function counts the minimum number of prope…
Enumeratively Chromatic-Choosable Theta Graphs
Yanghong Chi, Seoju Lee, Fennec Morrissette +3
Chromatic choosability is a notion of fundamental importance in list coloring. A graph is chromatic-choosable when its chromatic number, , is equal to its list chromatic…
Fractional Strict Degeneracy of Graphs
Daniel Dominik, Jeffrey A. Mudrock
DP-coloring (also called correspondence coloring) is a generalization of list coloring introduced by DvoÅák and Postle in 2015. The DP-chromatic number of a graph , $Ï_{_{DP}…
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…
On the Ohba Number and Generalized Ohba Numbers of Complete Bipartite Graphs
Kennedy Cano, Emily Gutknecht, Gautham Kappaganthula +3
We say that a graph is chromatic-choosable when its list chromatic number is equal to its chromatic number . Chromatic-choosability is a well-studied topi…