An efficient implementation and a strengthening of Alon-Tarsi list coloring method

Zdeněk Dvořák

As one of the first applications of the polynomial method in combinatorics, Alon and Tarsi gave a way to prove that a graph is choosable (colorable from any lists of prescribed siz…