Online Chromatic Number is PSPACE-Complete
Computational Complexity
2017-06-27 v2 Combinatorics
Abstract
In the online graph coloring problem, vertices from a graph G, known in advance, arrive in an online fashion and an algorithm must immediately assign a color to each incoming vertex v so that the revealed graph is properly colored. The exact location of v in the graph G is not known to the algorithm. The online chromatic number of G is the smallest number of colors such that some online algorithm is able to properly color G for any incoming order. We prove that computing the online chromatic number of a graph is PSPACE-complete.
Keywords
Cite
@article{arxiv.1604.05940,
title = {Online Chromatic Number is PSPACE-Complete},
author = {Martin Böhm and Pavel Veselý},
journal= {arXiv preprint arXiv:1604.05940},
year = {2017}
}