Abstrakt
Let G be a graph with a list assignment L. Suppose a preferred color is given for some of the vertices; how many of these preferences can be respected when L-coloring G? We explore several natural questions arising in this context, and propose directions for further research.