The Alon-Tarsi number of -minor-free graphs
arXiv:1911.04067
Abstract
In this paper, we show the following three theorems. Let be a -minor-free graph. Then Alon-Tarsi number of is at most , there exists a matching of such that the Alon-Tarsi number of is at most , and there exists a forest such that the Alon-Tarsi number of is at most .
12 pages,2 figures