Abstract: A graph G is called (k,d)*-choosable if for every list assignment L satisfying |L(v)|=k for all v ∈ V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. In this paper, it is shown that every planar graph without 6-circuits and a triangle adjacent to itself or a quadrangle is (3,1)*-choosable.

Key words: