The Alon-Tarsi number of K3,3-minor-free graphs
Abstract
The well known Wagner's theorem states that a graph is a planar graph if and only if it is K5-minor-free and K3,3-minor-free. Denote by AT(G) the Alon-Tarsi number of a graph G. We show that for any K3,3-minor-free graph G, AT(G) 5, there exists a matching M and a forest F such that AT(G-M) 4 and AT(G-E(F)) 3, extending the result on the Alon-Tarsi number of K5-minor-free graphs due to Abe, Kim and Ozeki.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.