Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs |
scientific article |
Statements
Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (English)
0 references
21 May 2020
0 references
neighbor sum distinguishing coloring
0 references
adjacent vertex distinguishing coloring
0 references
planar graph
0 references
combinatorial nullstellensatz
0 references
list coloring
0 references
0 references
0 references
0 references
0 references
