The Alon-Tarsi number of planar graphs -- a simple proof

preprint2022arXivOpen access

This paper gives a simple proof of the result that every planar graph $G$ has Alon-Tarsi number at most 5, and has a matching $M$ such that $G-M$ has Alon-Tarsi number at most 4.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

The Alon-Tarsi number of planar graphs -- a simple proof

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0