A Strengthening and an Efficient Implementation of Alon-Tarsi List Coloring Method

Abstract

As one of the first applications of the polynomial method in combinatorics, Alon and Tarsi proved that if certain coefficients of the graph polynomial are non-zero, then the graph is choosable, i.e., colorable from any assignment of lists of prescribed size.  We show that in case all relevant coefficients are zero, then further coefficients of the graph polynomial provide constraints on the list assignments from which the graph cannot be colored.  This often enables us to confirm colorability from a given list assignment, or to decide choosability by  testing just a few list assignments.  We also describe an efficient way to implement this approach, making it feasible to test choosability of graphs with around 70 edges.