Every planar graph is 5-choosable (Q1333334): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1994.1062 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089023036 / rank | |||
Revision as of 14:33, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every planar graph is 5-choosable |
scientific article |
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
