A note on the minimum number of choosability of planar graphs

The problem of minimum number of choosability of graphs was first introduced.by Vizing. It appears in some practical problems when concerning frequency.assignment. In this paper, we study two important list coloring, list edge coloring and.list total coloring. We prove that χl (G) = Δ and χl (G) = Δ