Neighbor sum distinguishing total choosability of planar graphs (Q326491)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Neighbor sum distinguishing total choosability of planar graphs |
scientific article; zbMATH DE number 6637640
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor sum distinguishing total choosability of planar graphs |
scientific article; zbMATH DE number 6637640 |
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
0.96900034
0 references
0 references
0.96384585
0 references
0.96362686
0 references
0.95787156
0 references
0.9553618
0 references
0.9491916
0 references
0.94475687
0 references
0.94206244
0 references
