7 papers · 1 filter
Flexible list colorings: Maximizing the number of requests satisfied
Hemanshu Kaul, Rogers Mathew, Jeffrey A. Mudrock +1
Flexible list coloring was introduced by Dvořák, Norin, and Postle in 2019. Suppose , is a graph, is a list assignment for , and is a function with n…
On Equitable List Arboricity of Graphs
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer
Equitable list arboricity, introduced by Zhang in 2016, generalizes the notion of equitable list coloring by requiring the subgraph induced by each color class to be acyclic (inste…
Partial DP-Coloring
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer
In 1980, Albertson and Berman introduced partial coloring. In 2000, Albertson, Grossman, and Haas introduced partial list coloring. Here, we initiate the study of partial coloring…
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…
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…