2000 character limit reached
The Alon-Tarsi number of -minor-free graphs
Published 11 Oct 2023 in math.CO | (2310.07445v2)
Abstract: The well known Wagner's theorem states that a graph is a planar graph if and only if it is -minor-free and -minor-free. Denote by the Alon-Tarsi number of a graph . We show that for any -minor-free graph , , there exists a matching and a forest such that and , extending the result on the Alon-Tarsi number of -minor-free graphs due to Abe, Kim and Ozeki.
Paper Prompts
Sign up for free to create and run prompts on this paper.