Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657): 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.dam.2016.02.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2296149237 / rank | |||
Normal rank | |||
Revision as of 22:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighbor sum distinguishing total choosability of planar graphs without 4-cycles |
scientific article |
Statements
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (English)
0 references
2 May 2016
0 references
neighbor sum distinguishing total coloring
0 references
choosability
0 references
combinatorial nullstellensatz
0 references
planar graph
0 references
