%0 Journal Article
%T Deciding the On-line Chromatic Number of a Graph with Pre-Coloring is PSPACE-Complete
%A Christian Kudahl
%J Computer Science
%D 2014
%I arXiv
%X 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.
%U http://arxiv.org/abs/1406.1623v1