2 citations · 4 across the 34 of their papers we have counts for
8 papers · 1 filter
List Coloring a Cartesian Product with a Complete Bipartite Factor
Hemanshu Kaul, Jeffrey A. Mudrock
We study the list chromatic number of the Cartesian product of any graph and a complete bipartite graph with partite sets of size and , denoted $χ_\ell(G \square K_{a,b}…
A Note on the Equitable Choosability of Complete Bipartite Graphs
Jeffrey A. Mudrock, Madelynn Chase, Isaac Kadera +2
In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A -assignment, , for a graph assigns a list, …
A Simple Characterization of Proportionally 2-choosable Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer +1
We recently introduced proportional choosability, a new list analogue of equitable coloring. Like equitable coloring, and unlike list equitable coloring (a.k.a. equitable choosabil…
Proportional Choosability: A New List Analogue of Equitable Coloring
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer +1
In 2003, Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. In this paper, we motivate and define a new list analogue of…
Criticality, The List Color Function, and List Coloring the Cartesian Product of Graphs
Hemanshu Kaul, Jeffrey A. Mudrock
We introduce a notion of color-criticality in the context of chromatic-choosability. We define a graph to be strong -chromatic-choosable if and every -assi…
A Note on the DP-Chromatic Number of Complete Bipartite Graphs
Jeffrey A. Mudrock
DP-coloring (also called correspondence coloring) is a generalization of list coloring recently introduced by Dvořák and Postle. Several known bounds for the list chromatic number…
On the Alon-Tarsi Number and Chromatic-choosability of Cartesian Products of Graphs
Hemanshu Kaul, Jeffrey A. Mudrock
We study the list chromatic number of Cartesian products of graphs through the Alon-Tarsi number as defined by Jensen and Toft (1995) in their seminal book on graph coloring proble…
Total Equitable List Coloring
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer
An equitable coloring is a proper coloring of a graph such that the sizes of the color classes differ by at most one. A graph is equitably -colorable if there exists an equi…