• Corpus ID: 239616075

The Alon-Tarsi number of Halin graphs

  title={The Alon-Tarsi number of Halin graphs},
  author={Zhiguo Li and Qingjie Ye and Zeling Shao},
The Alon-Tarsi number of a graph G is the smallest k for which there is an orientation D of G with max outdegree k− 1 such that the number of Eulerian subgraphs of G with an even number of edges differs from the number of Eulerian subgraphs with an odd number of edges. In this paper, we obtain the Alon-Tarsi number of a Halin graph equals 4 when it is a wheel of even order and 3 otherwise. 


The Alon-Tarsi number of K5-minor-free graphs
In this paper, we show the following three theorems. Let $G$ be a $K_5$-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
The Alon-Tarsi number of planar graphs
  • Xuding Zhu
  • Mathematics, Computer Science
    J. Comb. Theory, Ser. B
  • 2019
This paper proves that the Alon-Tarsi number of any planar graph is at most $5$, which gives an alternate proof of the $5$-choosability as well as the $5$-paintability of planar graphs.
Colorings and orientations of graphs
Bounds for the chromatic number and for some related parameters of a graph are obtained by applying algebraic techniques by proving that there is a legal vertex-coloring of G assigning to each vertexv a color fromS(v).
The Alon-Tarsi Number of A Toroidal Grid
The Alon-Tarsi number $AT(G)$ of a graph $G$ is the smallest $k$ for which there is an orientation $D$ of $G$ with max indegree $k-1$ such that the number of even and odd circulations contained in D
The Alon-Tarsi number of a planar graph minus a matching
It is proved that every planar graph G contains a matching M such that the Alon-Tarsi number of G-M is at most $4, and hence G itself is 1-defective $4-paintable.
On two generalizations of the Alon-Tarsi polynomial method
  • Dan Hefetz
  • Mathematics, Computer Science
    J. Comb. Theory, Ser. B
  • 2011
The first characterization is generalized by showing that there is an infinite family of weight functions (which includes the one considered by Alon and Tarsi), each of which can be used to characterize AT(G), and the second generalization is generalized to all graphs and proves that @g(G)=ch (G)=AT(G) holds for certain families of graphs G.
A Paintability Version of the Combinatorial Nullstellensatz, and List Colorings of k-partite k-uniform Hypergraphs
  • U. Schauz
  • Mathematics, Computer Science
    Electron. J. Comb.
  • 2010
A new upper bound is presented which generalizes Alon and Tarsi's bound for bipartite graphs, the case $k=2, which holds even for paintability (on" line list colorability).
Game chromatic index of k-degenerate graphs
The game chromatic index of a graph G is the minimum number of colors for which Alice has a winning strategy and is studied in this paper.
Defective List Colorings of Planar Graphs
We combine the concepts of list colorings of graphs with the concept of defective colorings of graphs and introduce the concept of defective list colorings. We apply these concepts to vertex
Every Planar Graph Is 5-Choosable
  • C. Thomassen
  • Computer Science, Mathematics
    J. Comb. Theory, Ser. B
  • 1994
We prove the statement of the title, which was conjectured in 1975 by V. G. Vizing and, independently, in 1979 by P. Erdos, A. L. Rubin, and H Taylor.