Abstract: A graph G is called (k,d)^*-choosable if, for every list assignment L with |L(v)|=k for all v\in V(G), there is anL$-coloring of G such that every vertex has at most d neighbors receiving the same color as itself. Let G be a graph embedded in a surface of nonnegative characteristic. In this paper, we prove that if G is a 2-connected graph, which contains no 5-cycles, adjacent 3-faces and adjacent 4-faces, then G is (3,1)^*-choosable

Key words: list improper coloring;characteristic, cycle;Euler's formula