Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2016.02.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2016.02.003 / rank | |||
Normal rank | |||
Revision as of 15:32, 8 December 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
0 references
0 references
0 references
0 references
