WorksMathematics
The chromatic-AT choosability of Pseudo-Halin graphs
Abstract
The Alon-Tarsi number of a graph is the smallest integer such that admits an orientation with maximum outdegree at most in which the number of even Eulerian subdigraphs differs from the number of odd Eulerian subdigraphs. A 2-connected planar graph with minimum degree at least 3 is called a pseudo-Halin graph if deleting the edges on the boundary of a single face yields a tree. Let denote the class of pseudo-Halin graphs in which no two interior vertices are adjacent and every interior vertex has odd degree (equivalently, graphs obtained by iterated Hajós sums of wheels with an odd number of exterior vertices). In this paper, we completely determine the chromatic number and the Alon-Tarsi number of all pseudo-Halin graphs. Specifically, by structural induction and the method of -orientations, we prove that if , and otherwise. Consequently, every pseudo-Halin graph is chromatic-AT choosable.