The (d,1)-total labelling of graphs was introduced by Havet and Yu. In this
paper, we consider the list version of (d,1)-total labelling of graphs. Let G
be a graph embedded in a surface with Euler characteristic ϵ whose
maximum degree Δ(G) is sufficiently large. We prove that the (d,1)-total
choosability Cd,1T​(G) of G is at most Δ(G)+2d.Comment: 6 page