On two generalizations of the Alon-Tarsi polynomial method
From MaRDI portal
Publication:651032
DOI10.1016/j.jctb.2010.12.007zbMath1234.05086arXiv0911.2099OpenAlexW2041832100MaRDI QIDQ651032
Publication date: 8 December 2011
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.2099
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items
The Alon-Tarsi number of planar graphs, List-Coloring Claw-Free Graphs with $\Delta-1$ Colors, On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs, The Alon–Tarsi number of planar graphs revisited, The Alon-Tarsi number of two kinds of planar graphs, The Alon-Tarsi number of a toroidal grid, On the Alon-Tarsi number of semi-strong product of graphs, The Alon-Tarsi number of a planar graph minus a matching, On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs, Combinatorial Nullstellensatz and DP-coloring of graphs, Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs, An algebraic criterion for the choosability of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independence numbers of graphs and generators of ideals
- A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
- Brooks' theorem via the Alon-Tarsi theorem
- A nowhere-zero point in linear mappings
- On the Penrose number of cubic diagrams
- Colorings and orientations of graphs
- A solution to a colouring problem of P. Erdős
- The graph polynomial and the number of proper vertex colorings
- List \(T\)-colorings of graphs
- A note on graph colorings and graph polynomials
- \(T\)-choosability in graphs
- Choosability of powers of circuits
- The number of edge 3-colorings of a planar cubic graph as a permanent
- \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
- The list chromatic index of a bipartite multigraph
- Asymptotically good list-colorings
- Mr. Paint and Mrs. Correct
- On-line list colouring of graphs
- Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
- Hypergraph extension of the Alon-Tarsi list coloring theorem
- A relation between choosability and uniquely list colorability
- List edge colourings of some 1-factorable multigraphs
- The size of uniquely colorable graphs
- Bounding the Independence Number of a Graph
- Uniquely Colourable Graphs with Large Girth
- Combinatorial Nullstellensatz
- Construction of uniquely vertex k-colorable graphs with minimum possible size
- Uniquely colorable graphs
- On uniquely colorable planar graphs
- Anti‐magic graphs via the Combinatorial NullStellenSatz
