加载中…
Let be any signed planar graph. We show that the Alon-Tarsi number of is at most 5, generalizing a recent result of Zhu for unsigned case. In addition, if is -colorable then has the Alon-Tarsi number at most 4. We also construct a signed planar graph which is -colorable but not -choosable.

生成讲解博客的中文版本

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