We provide a general framework on the coefficients of the graph polynomials
of graphs which are Cartesian products. As a corollary, we prove that if
is a graph with
degrees of vertices ,
, and the graph
polynomial
contains an “almost central” monomial (that is a monomial
, where
for all
), then the
Cartesian product
is
-choosable.
Keywords
combinatorial Nullstellensatz, list coloring, Alon–Tarsi
number