加载中…
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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本