Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 (Q1740118)
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 with maximum degree 10 |
scientific article; zbMATH DE number 7048888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 |
scientific article; zbMATH DE number 7048888 |
Statements
Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 (English)
0 references
29 April 2019
0 references
neighbor sum distinguishing total coloring
0 references
planar graph
0 references
combinatorial Nullstellensatz
0 references
discharging
0 references
0 references
0 references
0 references
0.947423815727234
0 references
0.945719838142395
0 references
0.9348599314689636
0 references
0.9305586814880372
0 references
