Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions (Q5035848)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7479279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions |
scientific article; zbMATH DE number 7479279 |
Statements
Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions (English)
0 references
22 February 2022
0 references
NIC-planar graphs
0 references
neighbor sum distinguishing total choice number
0 references
combinatorial nullstellensatz
0 references
0 references
0 references
0.94532824
0 references
0.94475687
0 references
0.92784065
0 references
0.9230747
0 references
0 references
0.9204334
0 references
0.9195627
0 references
0 references
0.9099116
0 references
