On choosability with separation of planar graphs with lists of different sizes (Q2346342)
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: On choosability with separation of planar graphs with lists of different sizes |
scientific article; zbMATH DE number 6441701
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On choosability with separation of planar graphs with lists of different sizes |
scientific article; zbMATH DE number 6441701 |
Statements
On choosability with separation of planar graphs with lists of different sizes (English)
0 references
1 June 2015
0 references
graph coloring
0 references
planar graphs
0 references
choosability with separation
0 references
list coloring
0 references
0.9279740452766418
0 references
0.9192579388618468
0 references
0.9119004607200624
0 references
0.8831905722618103
0 references
0.8792197704315186
0 references
