On the Alon-Tarsi Number and Chromatic-Choosability of Cartesian Products of Graphs
On the Alon-Tarsi Number and Chromatic-Choosability of Cartesian Products of Graphs
We study the list chromatic number of Cartesian products of graphs through the Alon-Tarsi number as defined by Jensen and Toft (1995) in their seminal book on graph coloring problems. The Alon-Tarsi number of $G$, $AT(G)$, is the smallest $k$ for which there is an orientation, $D$, of $G$ with …