Every planar graph is 5-choosable (Q1333334)
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: Every planar graph is 5-choosable |
scientific article; zbMATH DE number 638655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every planar graph is 5-choosable |
scientific article; zbMATH DE number 638655 |
Statements
Every planar graph is 5-choosable (English)
0 references
26 January 1995
0 references
The author shows the 5-choosability of planar graphs. This result was conjectured by \textit{V. G. Vizing} [Kibernetika, Kiev 1975, Nr. 1, 135-138 (1975; Zbl 0309.90060)], and independently by \textit{P. Erdős}, \textit{A. L. Rubin} and \textit{H. Taylor} [Combinatorics, graph theory and computing, Proc. West Coast Conf., Arcata/Cal. 1979, 125-157 (1980; Zbl 0469.05032)].
0 references
list coloring
0 references
choosability
0 references
planar graphs
0 references
0.8814371824264526
0 references
0.8698604106903076
0 references
0.8642767667770386
0 references
