Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz |
scientific article |
Statements
Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (English)
0 references
23 May 2016
0 references
neighbor sum distinguishing total coloring
0 references
combinatorial nullstellensatz
0 references
neighbor sum distinguishing total choice number
0 references
0 references
0 references
0 references
0 references
0 references
