Neighbor sum distinguishing total coloring of a kind of sparse graph. (Q2829032)
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 coloring of a kind of sparse graph. |
scientific article; zbMATH DE number 6644231
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor sum distinguishing total coloring of a kind of sparse graph. |
scientific article; zbMATH DE number 6644231 |
Statements
26 October 2016
0 references
discharging method
0 references
combinatorial Nullstellensatz
0 references
neighbor sum distinguishing total coloring
0 references
Neighbor sum distinguishing total coloring of a kind of sparse graph. (English)
0 references
0.9227457046508788
0 references
0.9128010869026184
0 references
0.9069014191627502
0 references
0.9049841165542604
0 references
