2 citations · 4 across the 34 of their papers we have counts for
4 papers · 1 filter
An Ohba-like Result for Flexible List Coloring
Michael C. Bowdoin, Yanghong Chi, Christian B. Ellington +4
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…
List Coloring the Cartesian Product of a Complete Graph and Complete Bipartite Graph
Hemanshu Kaul, Leonardo Marciaga, Jeffrey A. Mudrock
We study the list chromatic number of the Cartesian product of a complete graph of order and a complete bipartite graph with partite sets of size and , denoted $χ_{\ell}…
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…
Enumerative Chromatic Choosability
Sarah Allred, Jeffrey A. Mudrock
Chromatic-choosablility is a notion of fundamental importance in list coloring. A graph is chromatic-choosable when its chromatic number is equal to its list chromatic number. In 1…