Planar graphs that have non short cycles with a chord are 3-choosable (Q2470800)

An assignment \(L\) for a graph \(G\) is a way to assign a list \(L(v)\) of possible colours (\(1,\dots, k\)) to each vertex \(v\) of \(G\). If \(G\) has a proper colouring \(\phi\) such that \(\phi(v)\in L(v)\) for all vertices \(v\), then one says that \(G\) is \(L\)-colorable. Then, the graph is \(k\)-choosable if it is \(L\)-colorable for every assignment \(L\) satisfying \(| L(v)| =k\) for all vertices \(v\). The choice number of \(G\) is the smallest \(k\) such that \(G\) is choosable. The author proves that every planar graph \(G\) is 3-choosable if it contains on cylce of length less than or equal to \(10\) with a chord. This generalizes previous results (by \textit{O.V. Borodin}, \textit{D.-P. Sanders}, and \textit{Y. Zhao} [Discrete Math. 203, No.\,1-3, 23--40 (1999; Zbl 0929.05027)]) proving that planar graphs without \(k\)-cycles for \(4\leq k\leq 9\) are \(3\)-colorable.