Neighbor sum distinguishing total chromatic number of planar graphs (Q2333237)
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 chromatic number of planar graphs |
scientific article; zbMATH DE number 7128598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor sum distinguishing total chromatic number of planar graphs |
scientific article; zbMATH DE number 7128598 |
Statements
Neighbor sum distinguishing total chromatic number of planar graphs (English)
0 references
12 November 2019
0 references
neighbor sum distinguishing total chromatic number
0 references
combinatorial Nullstellensatz
0 references
planar graph
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9564035534858704
0 references
0.9509370923042296
0 references
0.9467061161994934
0 references
0.9325716495513916
0 references
