2000 character limit reached
Alon-Tarsi number of signed planar graphs
Published 9 Sep 2018 in math.CO | (1809.02907v1)
Abstract: 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 $2$-colorable then has the Alon-Tarsi number at most 4. We also construct a signed planar graph which is $2$-colorable but not $3$-choosable.
Paper Prompts
Sign up for free to create and run prompts on this paper.