Neighbor-sum-distinguishing edge choosability of subcubic graphs (Q1680485)
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 6807510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor-sum-distinguishing edge choosability of subcubic graphs |
scientific article; zbMATH DE number 6807510 |
Statements
Neighbor-sum-distinguishing edge choosability of subcubic graphs (English)
0 references
16 November 2017
0 references
subcubic graph
0 references
list neighbor-sum-distinguishing edge coloring
0 references
maximum average degree
0 references
combinatorial nullstellensatz
0 references
0 references
0.9257574677467346
0 references
0.8943679928779602
0 references
0.8683133721351624
0 references
0.8663355112075806
0 references
0.8519971966743469
0 references
