Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186)
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: Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs |
scientific article; zbMATH DE number 7202845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs |
scientific article; zbMATH DE number 7202845 |
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
0.9077361226081848
0 references
0.8965052366256714
0 references
0.8941867351531982
0 references
0.893179178237915
0 references
0.8927055597305298
0 references
