zbMATH — the first resource for mathematics

Choosability of planar graphs. (English) Zbl 0852.05048
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).

05C15 Coloring of graphs and hypergraphs
05C10 Planar graphs; geometric and topological aspects of graph theory
Full Text: DOI
[1] Albertson, M.O.; Berman, D.M., Cliques, colorings and locally perfect graphs, (), 69-73 · Zbl 0576.05024
[2] Alon, N.; Tarsi, M., Colorings and orientations of graphs, Combinatorica, 12, 125-134, (1992) · Zbl 0756.05049
[3] Erdős, P.; Rubin, A.L.; Taylor, H., Choosability in graphs, (), 5.-7.9
[4] Lovaśz, L., Combinatorial problems and exercises, (1979), Akadémiai Kiadó Budapest · Zbl 0439.05001
[5] N.V.R. Mahadev, F.S. Roberts and P. Santhanakrishnan, 3-choosable complete bipartite graphs, DIMACS, Tech. Report 91-62.
[6] Roberts, F.S., From garbage to rainbows: generalizations of graph coloring and their applications, RUTCOR research report 36-88, (July 1988)
[7] Tesman, B., T-colorings, List T-colorings, and set T-colorings of graphs, () · Zbl 0788.05047
[8] Vizing, V.G., Coloring the vertices of a graph in prescribed colors, Diskret. analiz. no. 29, metody diskret. anal. teorii kodov shem, 101, 3-10, (1976), (in Russian) · Zbl 1249.90303
[9] Voigt, M., List colourings of planar graphs, Discrete math., 120, 215-219, (1993) · Zbl 0790.05030
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.