The Alon-Tarsi number of K5-minor-free graphs
Abstract
In this paper, we show the following three theorems. Let G be a K5-minor-free graph. Then Alon-Tarsi number of G is at most 5, there exists a matching M of G such that the Alon-Tarsi number of G-M is at most 4, and there exists a forest F such that the Alon-Tarsi number of G-E(F) is at most 3.
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.