$(3,1{)}^{\ast }$-choosability of planar graphs without adjacent short cycles

Min Chen, Andre Raspaud

A list assignment of a graph $G$ is a function $L$ that assigns a list $L(v)$ of colors to each vertex $v\in V(G)$. An $(L,d{)}^{\ast }$-coloring is a mapping $\pi$ that assigns a color $π(v…