Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250)

Given a graph \(G=(V, E)\), a list assignment of \(G\) is a function \(\lambda : V \to\cup_{v \in V}L(v)\) such that \(\lambda(v) \in L(v)\) for all \(v\in V\) and \(\lambda(u) \not = \lambda(v)\) whenever \(uv \in E\). The graph \(G\) is called \(k\)-choosable if it has an \(L\)-coloring for all \(L\) with \(\vert L(v)\vert \geq k\) for any \(v\in V(G)\). The main result is stated next. Theorem. Every planar graph without adjacent cycles of length at most 8 is 3-choosable.