Minimum choosability of planar graphs (Q724728)
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: Minimum choosability of planar graphs |
scientific article; zbMATH DE number 6910538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum choosability of planar graphs |
scientific article; zbMATH DE number 6910538 |
Statements
Minimum choosability of planar graphs (English)
0 references
26 July 2018
0 references
list coloring
0 references
choosability
0 references
planar graph
0 references
chordal
0 references
0 references
0 references
0.9400290250778198
0 references
0.9038185477256776
0 references
0.8886430263519287
0 references
0.8884462118148804
0 references
0.8880969882011414
0 references
