Every planar graph with ${\rm{\Delta }}$ > 8 is totally (+2) $({\rm{\Delta }}+2)$-choosable

Total coloring is a variant of edge coloring where both vertices and edges are to be colored. A graph is totally k $k$-choosable if for any list assignment of k $k$ colors to each vertex and each edge, we can extract a proper total coloring. In this setting, a graph of maximum degree Delta ${\rm{\Delta }}$ needs at least Delta+1 ${\rm{\Delta }}+1$ colors. In the planar case, Borodin proved in 1989 that Delta+2 ${\rm{\Delta }}+2$ colors suffice when Delta ${\rm{\Delta }}$ is at least 9. We show that this bound also holds when Delta ${\rm{\Delta }}$ is 8.