Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (Q2292143)
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 colorings of IC-planar graphs with maximum degree 13 |
scientific article; zbMATH DE number 7161784
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 |
scientific article; zbMATH DE number 7161784 |
Statements
Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (English)
0 references
3 February 2020
0 references
neighbor sum distinguishing total coloring
0 references
IC-planar graph
0 references
discharging method
0 references
0 references
0 references
0 references
0 references
0 references
0.9441949725151062
0 references
0.9397004246711732
0 references
0.933443009853363
0 references
0.9295834302902222
0 references
0.9192836284637452
0 references
