A note on choosability with separation for planar graphs. (Q2716011)
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 choosability with separation for planar graphs. |
scientific article; zbMATH DE number 1600978
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on choosability with separation for planar graphs. |
scientific article; zbMATH DE number 1600978 |
Statements
20 July 2005
0 references
choosability
0 references
planar graphs
0 references
A note on choosability with separation for planar graphs. (English)
0 references
The author presents a direct proof of the theorem by \textit{J.\ Kratochvíl, Zs.\ Tuza} and \textit{M.\ Voigt} [J.\ Graph Theory 27, 43-49 (1998; Zbl 0894.05016)] that every planar graph is \((4t,t,3t)\)-choosable. He also constructs a graph on 119 vertices that is not \((3,1,1)\)-choosable. Finally, three open problems from this field are presented.
0 references
