Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (Q6178525)
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 planar graphs with maximum degree at least 10 |
scientific article; zbMATH DE number 7788853
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 |
scientific article; zbMATH DE number 7788853 |
Statements
Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (English)
0 references
16 January 2024
0 references
planar graphs
0 references
neighbor sum distinguishing total choosibility
0 references
combinatorial nullstellensatz
0 references
discharging method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.930555820465088
0 references
0.9267606139183044
0 references
0.9240618944168092
0 references
0.9192138314247132
0 references
