Neighbor sum distinguishing total choosability of planar graphs (Q326491)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighbor sum distinguishing total choosability of planar graphs |
scientific article |
Statements
Neighbor sum distinguishing total choosability of planar graphs (English)
0 references
12 October 2016
0 references
neighbour sum distinguishing total choosability
0 references
planar graph
0 references
total coloring
0 references
discharging
0 references
combinatorial nullstellensatz
0 references
0 references
0 references
0 references
0 references
