Deciding the On-line Chromatic Number of a Graph with Pre-Coloring is PSPACE-Complete

The problem of determining if the on-line chromatic number of a graph is less than or equal to k, given a pre-coloring, is shown to be PSPACE-complete.