Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:17, 30 January 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
