Neighbor sum distinguishing total choosability of cubic graphs (Q2227993)
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 cubic graphs |
scientific article; zbMATH DE number 7311129
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor sum distinguishing total choosability of cubic graphs |
scientific article; zbMATH DE number 7311129 |
Statements
Neighbor sum distinguishing total choosability of cubic graphs (English)
0 references
16 February 2021
0 references
cubic graphs
0 references
neighbor sum distinguishing total choosability
0 references
combinatorial Nullstellensatz
0 references
0 references
0 references
0 references
0 references
0.9126543402671814
0 references
0.8681759238243103
0 references
0.8633958101272583
0 references
0.845879077911377
0 references
0.8451505303382874
0 references
