The decision problem of list 3-coloring is NP-complete in general. The natural approach
to studying this problem is to restrict the problem to specific families of graphs. In this
paper, we examine the problem restricted to the family of P6-free graphs. We describe a
novel polynomial time algorithm for solving the decision problem in this setting.