Incidence choosability of graphs

In this paper, we introduce and study the list version of incidence colouring. We determine the exact value of - or upper bounds on - the incidence choice number of several classes of graphs, namely square grids, Halin graphs, cactuses and Hamiltonian cubic graphs.