Flexibility of planar graphs without $C_4$ and $C_5$

Donglei Yang, Fan Yang

Let $G$ be a $\{C_4,C_5\}$-free planar graph with a list assignment $L$. Suppose a preferred color is given for some of the vertices. We prove that if all lists have size at least…