Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6672915
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles |
scientific article; zbMATH DE number 6672915 |
Statements
Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (English)
0 references
9 January 2017
0 references
neighbor sum distinguishing total coloring
0 references
choosability
0 references
combinatorial Nullstellensatz
0 references
planar graph
0 references
0 references
0 references
0 references
0 references
0 references
0.952346682548523
0 references
0.9487183690071106
0 references
0.9444854855537416
0 references
0.9388781785964966
0 references
