Every planar graph with $\Delta ⩾8$ is totally $(\Delta +2)$-choosable

Marthe Bonamy, Théo Pierron, Éric Sopena

Total coloring is a variant of edge coloring where both vertices and edges are to be colored. A graph is totally $k$-choosable if for any list assignment of $k$ colors to each vert…