Online Chromatic Number is PSPACE-Complete

Conference paper

DOI: 10.1007/978-3-319-44543-4_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9843)
Cite this paper as:
Böhm M., Veselý P. (2016) Online Chromatic Number is PSPACE-Complete. In: Mäkinen V., Puglisi S., Salmela L. (eds) Combinatorial Algorithms. IWOCA 2016. Lecture Notes in Computer Science, vol 9843. Springer, Cham

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, since it sees only previously colored neighbors of v. 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.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Computer Science Institute of Charles UniversityPragueCzech Republic

Personalised recommendations