Abstract. The List-3-Coloring Problem is to decide, given a graph G and a list L(v) ⊆ {1, 2, 3} of colors assigned to each vertex v of G, whether G admits a proper coloring ϕ with ϕ(v) ∈ L(v) for every vertex v of G, and ...