1 citations · 1 across the 5 of their papers we have counts for
1 paper · 2 filters
Christian Kudahl
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.