Flexible list coloring of graphs with maximum average degree less than $3$

Richard Bi, Peter Bradshaw

In the flexible list coloring problem, we consider a graph $G$ and a color list assignment $L$ on $G$, as well as a subset $U\subseteq V(G)$ for which each $u\in U$ has a preferr…