Neighbor sum distinguishing total choice number of planar graphs without 6-cycles (Q1995610)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighbor sum distinguishing total choice number of planar graphs without 6-cycles |
scientific article |
Statements
Neighbor sum distinguishing total choice number of planar graphs without 6-cycles (English)
0 references
24 February 2021
0 references
planar graphs
0 references
neighbor sum distinguishing total choice number
0 references
combinatorial Nullstellensatz
0 references
0 references
0 references
0 references
