List colorings of $K_5$-minor-free graphs with special list assignments

Daniel W. Cranston, Anja Pruchnewski, Zsolt Tuza +1

A {\it list assignment} $L$ of a graph $G$ is a function that assigns a set (list) $L(v)$ of colors to every vertex $v$ of $G$. Graph $G$ is called {\it $L$-list colorable} if it a…