Jeffrey A. Mudrock

activity

20182026

most citedOn Equitable List Arboricity of Graphs

2 citations · 4 across the 34 of their papers we have counts for

collaborators

Showing 2022Show all

5 papers · 1 filter

math.CO2022

An Algebraic Approach for Counting DP-3-colorings of Sparse Graphs

Samantha L. Dahlberg, Hemanshu Kaul, Jeffrey A. Mudrock

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 t…

math.CO2022

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 $0 \leq ε \leq 1$ , $G$ is a graph, $L$ is a list assignment for $G$ , and $r$ is a function with n…

math.CO2022

A Short Proof that the List Packing Number of any Graph is Well Defined

Jeffrey A. Mudrock

List packing is a notion that was introduced in 2021 (by Cambie et al.). The list packing number of a graph $G$ , denoted $χ_{ℓ}^{*} (G)$ , is the least $k$ such that for any list as…

math.CO2022

Bounding the List Color Function Threshold from Above

Hemanshu Kaul, Akash Kumar, Andrew Liu +5

The chromatic polynomial of a graph $G$ , denoted $P (G, m)$ , is equal to the number of proper $m$ -colorings of $G$ for each $m \in N$ . In 1990, Kostochka and Sidorenko intro…

math.CO2022

On the List Color Function Threshold

Hemanshu Kaul, Akash Kumar, Jeffrey A. Mudrock +3

The chromatic polynomial of a graph $G$ , denoted $P (G, m)$ , is equal to the number of proper $m$ -colorings of $G$ . The list color function of graph $G$ , denoted $P_{ℓ} (G, m)$ , is…