Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133)
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 coloring of sparse IC-planar graphs |
scientific article; zbMATH DE number 6851670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor sum distinguishing total coloring of sparse IC-planar graphs |
scientific article; zbMATH DE number 6851670 |
Statements
Neighbor sum distinguishing total coloring of sparse IC-planar graphs (English)
0 references
21 March 2018
0 references
neighbor sum distinguishing total coloring
0 references
maximum degree
0 references
IC-planar graph
0 references
combinatorial Nullstellensatz
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9601404070854188
0 references
0.9551489353179932
0 references
0.9531708359718324
0 references
0.934584379196167
0 references
0.9321142435073853
0 references
