A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles (Q306111)
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: A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles |
scientific article; zbMATH DE number 6620846
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles |
scientific article; zbMATH DE number 6620846 |
Statements
A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles (English)
0 references
31 August 2016
0 references
neighbor sum distinguishing total coloring
0 references
combinatorial Nullstellensatz
0 references
intersecting triangles
0 references
0 references
0 references
0 references
0 references
0 references
0.9369188
0 references
0.9332701
0 references
0.9250187
0 references
0.9203315
0 references
0.9181935
0 references
0.91810083
0 references
0.91769266
0 references
