A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
From MaRDI portal
Publication:612968
zbMath1201.05039arXiv1212.5694MaRDI QIDQ612968
Publication date: 16 December 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.5694
05C65: Hypergraphs
91A43: Games involving graphs
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
11C08: Polynomials in number theory
05C15: Coloring of graphs and hypergraphs
Related Items
Constructing integer-magic graphs via the Combinatorial Nullstellensatz, Locally planar graphs are 2-defective 4-paintable, Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices, Network Capacity Bound for Personalized PageRank in Multimodal Networks, The Alon-Tarsi number of two kinds of planar graphs, Schnyder woods and Alon-Tarsi number of planar graphs, The tournament scheduling problem with absences, Application of polynomial method to on-line list colouring of graphs, On-line list coloring of matroids, On two generalizations of the Alon-Tarsi polynomial method, Critically paintable, choosable or colorable graphs, Chip games and paintability, Proof of the list edge coloring conjecture for complete graphs of prime degree, The Alon-Tarsi number of planar graphs, Computing the list chromatic index of graphs, Locally planar graphs are 5-paintable, The list-chromatic index of \(K_6\), Towards an on-line version of Ohba's conjecture, Painting squares in \(\Delta^2-1\) shades, Partial Online List Coloring of Graphs, Brooks' Theorem and Beyond
