The Alon-Tarsi number of planar graphs revisited

JOURNAL OF GRAPH THEORY（2024）

引用 0|浏览1

暂无评分

摘要

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

查看译文

关键词

Alon-Tarsi number,list colouring,planar graph

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要