List-edge and list-total colorings of graphs embedded on hyperbolic surfaces (Q998357)

Let \(G=\left(V(G), E(G)\right)\) be a graph with maximum degree \(\Delta\). We say that \(G\) is totally \(f\)-choosable if, whenever a list \(A_x\) of \(f(x)\) colors is given to each element \(x \in V(G) \cup E(G)\), there exists a proper total coloring of \(G\) where each element is colored with a color from its own list, If \(f(x)=k\) for every element \(x \in V(G) \cup E(G)\), then \(G\) is said to be totally \(k\)-choosable. The list-total chromatic number \(\chi_{\text{list}}''(G)\) is the smallest integer \(k\) such that \(G\) is totally \(k\)-choosable. The edge \(f\)-choosability as well as the list-edge chromatic number \(\chi_{\text{list}}'(G)\) of \(G\) are defined similarly in terms of coloring edges alone. The main result of this paper shows that, if \(G\) is embedded on a surface of Euler characteristic \(\epsilon < 0\) and \(\Delta > \sqrt{25-24\epsilon}+10\), then \(\chi_{\text{list}}'(G)=\Delta\) and \(\chi_{\text{list}}''(G)=\Delta+1\).