On list-coloring outerplanar graphs

We prove that a 2-connected, outerplanar bipartite graph (respectively, outerplanar near-triangulation) with a list of colors L(v) for each vertex v such that |L(v)| >= min{deg(v), 4} (resp., |L(v)| >= min{deg(v), 5}) can be L-list-colored (except when the graph is K-3 with identical 2-lists). These results are best possible for each condition in the hypotheses and bounds. (C) 2008 Wiley Periodicals, Inc.