A sufficient condition for a planar graph to be 4-choosable (Q526822)
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 sufficient condition for a planar graph to be 4-choosable |
scientific article; zbMATH DE number 6715557
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sufficient condition for a planar graph to be 4-choosable |
scientific article; zbMATH DE number 6715557 |
Statements
A sufficient condition for a planar graph to be 4-choosable (English)
0 references
15 May 2017
0 references
planar graph
0 references
coloring
0 references
choosability
0 references
