Choosability of planar graphs
type: Item
instance of: scholarly article
title: Choosability of planar graphs
zbMATH Open document ID: 0852.05048
DOI: 10.1016/0012-365X(95)00216-J
published in: Discrete Mathematics
publication date: 1996-11-25T00:00:00Z
review text: We say the graph \(G= (V, E)\) is \(k\)-choosable if there is at least one \(L\)-list colouring for every possible list assignment \(L\) with \(|L(v)|= k\) for all \(v\in V\). \(G\) is called free \(k\)-choosable if such an \(L\)-list colouring exists for every list assignment \(L\), every vertex \(v\) and every colour \(f\in L(v)\). It is shown that the following conjectures are equivalent: every planar graph is 5-choosable (free 5-choosable).
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 896364
zbMATH Keywords: \(k\)-choosable
zbMATH Keywords: colouring
zbMATH Keywords: list assignment
author: Margit Voigt
reviewed by: Jozef Fiamčík
MaRDI profile type: Publication
cites work: Q3697034
cites work: Colorings and orientations of graphs
cites work: Q3922703
cites work: Q3880849
cites work: List \(T\)-colorings of graphs
cites work: Q3115277
cites work: List colourings of planar graphs
Recommended article: Path choosability of planar graphs
Recommended article: The complexity of planar graph choosability
Recommended article: The entire choosability of plane graphs
Recommended article: Minimum choosability of planar graphs
Recommended article: Choosability in signed planar graphs
Recommended article: On the total choosability of planar graphs and of sparse graphs
Recommended article: On structure of some plane graphs with application to choosability
Recommended article: A note on the minimum number of choosability of planar graphs
Recommended article: On the choosability of some graphs
Recommended article: Coupled choosability of plane graphs
description: scientific article; zbMATH DE number 896364