Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651): Difference between revisions
From MaRDI portal
Latest revision as of 06:13, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles |
scientific article |
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