Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2020.112115 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2020.112115 / rank | |||
Normal rank | |||
Latest revision as of 18:26, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial Nullstellensatz and DP-coloring of graphs |
scientific article |
Statements
Combinatorial Nullstellensatz and DP-coloring of graphs (English)
0 references
8 October 2020
0 references
The authors show how to apply the very well-known tool of the combinatorial Nullstellensatz to a variation of the list-coloring problem for graphs. The paper is very valuable and gives new significant light to the combinatorial Nullstellensatz theorem.
0 references
graph coloring
0 references
list coloring
0 references
Alon-Tarsi number
0 references
combinatorial Nullstellensatz
0 references
DP-coloring
0 references
0 references
0 references
0 references
