Deciding the On-line Chromatic Number of a Graph with Pre-Coloring is PSPACE-Complete
classification
💻 cs.CC
math.CO
keywords
chromaticgraphnumberon-linepre-coloringpspace-completedecidingdetermining
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.