Neighbor sum distinguishing total choosability of graphs with larger maximum average degree. (Q2828964)
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 graphs with larger maximum average degree. |
scientific article; zbMATH DE number 6644173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor sum distinguishing total choosability of graphs with larger maximum average degree. |
scientific article; zbMATH DE number 6644173 |
Statements
26 October 2016
0 references
neighbor sum distinguishing total coloring
0 references
combinatorial Nullstellensatz
0 references
neighbor sum distinguishing total choosability
0 references
Neighbor sum distinguishing total choosability of graphs with larger maximum average degree. (English)
0 references
0.9513863921165466
0 references
0.929158091545105
0 references
0.9134964942932128
0 references
0.9002227187156677
0 references
0.897494912147522
0 references
