Affiliation:
1. Department of Mathematics Zhejiang Normal University Jinhua China
Abstract
AbstractThis paper gives a simple proof of the result that every planar graph has Alon–Tarsi number at most 5, and has a matching such that has Alon–Tarsi number at most 4.
Funder
National Natural Science Foundation of China
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics