Papers
Topics
Authors
Recent
Search
2000 character limit reached

Alon-Tarsi number of signed planar graphs

Published 9 Sep 2018 in math.CO | (1809.02907v1)

Abstract: Let (G,σ)(G,\sigma) be any signed planar graph. We show that the Alon-Tarsi number of (G,σ)(G,\sigma) is at most 5, generalizing a recent result of Zhu for unsigned case. In addition, if (G,σ)(G,\sigma) is $2$-colorable then (G,σ)(G,\sigma) has the Alon-Tarsi number at most 4. We also construct a signed planar graph which is $2$-colorable but not $3$-choosable.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.