Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.11.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2556610696 / rank | |||
Normal rank | |||
Revision as of 23:51, 19 March 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
