Lidický, Bernard On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles. (English) Zbl 1177.05042 Australas. J. Comb. 44, 77-86 (2009). Summary: A graph is \(k\)-choosable if it can be colored whenever every vertex has a list of available colors of size at least \(k\). It is a generalization of graph coloring where all vertices do not have the same available colors. We show that every traingle-free plane graph without 6-, 7- and 8-cycles is 3-choosable. Cited in 5 Documents MSC: 05C15 Coloring of graphs and hypergraphs 05C10 Planar graphs; geometric and topological aspects of graph theory Keywords:choosability; list colouring Citations:Zbl 0756.05049; Zbl 0469.05032; Zbl 0807.68055; Zbl 1062.05061; Zbl 0805.05023; Zbl 0822.05029; Zbl 0362.05060; Zbl 0790.05030; Zbl 0843.05034; Zbl 1083.05504; Zbl 1045.05047 PDFBibTeX XMLCite \textit{B. Lidický}, Australas. J. Comb. 44, 77--86 (2009; Zbl 1177.05042)