Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913)
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 distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz |
scientific article; zbMATH DE number 6583926
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz |
scientific article; zbMATH DE number 6583926 |
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
0.9305224
0 references
0.90054184
0 references
0.89753836
0 references
0.89713633
0 references
0.89569527
0 references
0.8952564
0 references
0.89350104
0 references
0.89324325
0 references
0.8929681
0 references
