On uniquely k-list colorable planar graphs, graphs on surfaces, and regular graphs

M. Abdolmaleki, J. P. Hutchinson, S. Gh. Ilchi +2

A graph $G$ is called uniquely k-list colorable (U$k$LC) if there exists a list of colors on its vertices, say $L=\{S_v\mid v\in V(G)\}$, each of size $k$, such that…