The stipulation polynomial of a uniquely list-colorable graph.
Jeffrey H. Dinitz, W. J. Martin · 1995
Let G be a simple graph and let S = (S 1; : : : ; S n) be a set of lists of colors at the vertices of G. G is said to be S list-colorable if there exists a proper coloring of G such that each vertex i takes its color from S i. Alon and Tarsi [1] have shown that G is S list-colorable if and only if its graph polynomial f