Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2016.11.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2016.11.003 / rank | |||
Normal rank | |||
Revision as of 02:56, 9 December 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
