An alternative approach for bounding the additive choice number of planar graphs (Q5224841)
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: An alternative approach for bounding the additive choice number of planar graphs |
scientific article; zbMATH DE number 7085086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An alternative approach for bounding the additive choice number of planar graphs |
scientific article; zbMATH DE number 7085086 |
Statements
24 July 2019
0 references
additive coloring
0 references
lucky labeling
0 references
reducible configuration
0 references
0.9133137464523317
0 references
0.8514895439147949
0 references
0.810082733631134
0 references
0.7960535883903503
0 references
0.7533199787139893
0 references
