Five-list-coloring graphs on surfaces III. One list of size one and one list of size two

This result is a lemma toward a more general theorem along the same lines, which we will use to prove that minimally non-L-colorable planar graphs with two pre-colored cycles of bounded length are of bounded size. The latter result has a number of applications which we pursue elsewhere.