zbMATH — the first resource for mathematics

The complexity of planar graph choosability. (English) Zbl 0865.05066
Margit Voigt gave examples of a planar graph which is not 4-choosable and a planar triangle-free graph which is not 3-choosable. The present author presents simpler examples. He also proves that the corresponding decision problems for planar graphs are NP-hard.

05C85 Graph algorithms (graph-theoretic aspects)
05C15 Coloring of graphs and hypergraphs
68R10 Graph theory (including graph drawing) in computer science
Full Text: DOI
[1] Alon, N.; Tarsi, M., Colorings and orientations of graphs, Combinatorica, 12, 125-134, (1992) · Zbl 0756.05049
[2] Erdős, P.; Rubin, A.L.; Taylor, H., Choosability in graphs, (), 125-157
[3] Garey, M.R.; Johnson, D.S., Computers and intractability, () · Zbl 0369.90053
[4] S. Gutner and M. Tarsi, Some results on (a : b)-choosability, submitted. · Zbl 1198.05049
[5] J. Kratochvil and Zs. Tuza, Algorithmic complexity of list colorings, Discrete Appl. Math. in press. · Zbl 0807.68055
[6] Lichtenstein, D., Planar formulae and their uses, SIAM J. comput., 11, 329-343, (1982) · Zbl 0478.68043
[7] Middendorf, M.; Pfeiffer, F., On the complexity of the disjoint paths problem, Combinatorica, 13, 97-107, (1993) · Zbl 0770.68072
[8] M. Stiebitz, private communication.
[9] Thomassen, C., Every planar graph is 5-choosable, () · Zbl 0805.05023
[10] Thomassen, C., 3-List-coloring planar graphs of girth 5, () · Zbl 0822.05029
[11] Vizing, V.G., Coloring the vertices of a graph in prescribed colors, (), 3-10, (in Russian) · Zbl 1249.90303
[12] Voigt, M., List colourings of planar graphs, Discrete math., 120, 215-219, (1993) · Zbl 0790.05030
[13] M. Voigt, A not 3-choosable planar graph without 3-cycles, Discrete Math., in press. · Zbl 0843.05034
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.