2 citations · 4 across the 34 of their papers we have counts for
6 papers · 1 filter
Cones of Theta Graphs are Enumeratively Chromatic-Choosable
Kingston Barnes, Vincent Fesenmeier, Braxton Gaither +7
Chromatic choosability is a fundamental notion in list coloring. A graph is chromatic-choosable if its chromatic number equals its list chromatic number . I…
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 $…
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}}(G…