pith. sign in

arxiv: 1809.02907 · v1 · pith:N2HGPO4Jnew · submitted 2018-09-09 · 🧮 math.CO

Alon-Tarsi number of signed planar graphs

classification 🧮 math.CO
keywords sigmaalon-tarsinumberplanarsignedcolorablegraphaddition
0
0 comments X
read the original abstract

Let $(G,\sigma)$ be any signed planar graph. We show that the Alon-Tarsi number of $(G,\sigma)$ is at most 5, generalizing a recent result of Zhu for unsigned case. In addition, if $(G,\sigma)$ is $2$-colorable then $(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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.