Alon-Tarsi number of signed planar graphs
Abstract
Let (G,σ) be any signed planar graph. We show that the Alon-Tarsi number of (G,σ) is at most 5, generalizing a recent result of Zhu for unsigned case. In addition, if (G,σ) is 2-colorable then (G,σ) has the Alon-Tarsi number at most 4. We also construct a signed planar graph which is 2-colorable but not 3-choosable.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.