Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Neighbor sum distinguishing total choosability of planar graphs without 4-cycles |
scientific article; zbMATH DE number 6575693
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighbor sum distinguishing total choosability of planar graphs without 4-cycles |
scientific article; zbMATH DE number 6575693 |
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
