Combinatorial Nullstellensatz and DP-coloring of graphs
From MaRDI portal
Publication:2005703
DOI10.1016/j.disc.2020.112115zbMath1450.05029arXiv2003.01112OpenAlexW3079624409MaRDI QIDQ2005703
Jeffrey A. Mudrock, Hemanshu Kaul
Publication date: 8 October 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.01112
Related Items (8)
A deletion-contraction relation for the DP color function ⋮ The DP color function of joins and vertex-gluings of graphs ⋮ Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz ⋮ Partial DP-coloring of graphs ⋮ An algebraic approach for counting DP-3-colorings of sparse graphs ⋮ Non-chromatic-adherence of the DP color function via generalized theta graphs ⋮ Answers to two questions on the DP color function ⋮ Edge-face list coloring of Halin graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On two generalizations of the Alon-Tarsi polynomial method
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Proof of the list edge coloring conjecture for complete graphs of prime degree
- Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
- Colorings and orientations of graphs
- A solution to a colouring problem of P. Erdős
- Choosability of powers of circuits
- DP-3-coloring of some planar graphs
- The Alon-Tarsi number of planar graphs
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
- A sufficient condition for DP-4-colorability
- A note on the DP-chromatic number of complete bipartite graphs
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
- Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs
- On DP-coloring of graphs and multigraphs
- Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
- DP-colorings of graphs with high chromatic number
- DP-colorings of hypergraphs
- A relation between choosability and uniquely list colorability
- The asymptotic behavior of the correspondence chromatic number
- List Total Colourings of Graphs
- Combinatorial Nullstellensatz
- Sharp Dirac's theorem for DP‐critical graphs
- The Johansson‐Molloy theorem for DP‐coloring
- A note on a Brooks' type theorem for DP‐coloring
This page was built for publication: Combinatorial Nullstellensatz and DP-coloring of graphs
