Maximizing Satisfied Vertex Requests in List Coloring

Timothy Bennett, Michael C. Bowdoin, Haley Broadus +5

Suppose $G$ is a graph and $L$ is a list assignment for $G$. A request of $L$ is a function $r$ with nonempty domain $D\subseteq V(G)$ such that $r(v)\in L(v)$ for each $v\in D$.…