A note on 3-choosability of planar graphs related to Montanssier's conjecture (Q2810722)
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: A note on 3-choosability of planar graphs related to Montanssier's conjecture |
scientific article; zbMATH DE number 6589359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on 3-choosability of planar graphs related to Montanssier's conjecture |
scientific article; zbMATH DE number 6589359 |
Statements
3 June 2016
0 references
choosability
0 references
planar graph
0 references
cycle choosability
0 references
cycle
0 references
0.96464866
0 references
0.96464866
0 references
0.9453172
0 references
0 references
0 references
0.9319816
0 references
0.93180424
0 references
0.93180424
0 references
0.9313176
0 references
A note on 3-choosability of planar graphs related to Montanssier's conjecture (English)
0 references
