Hardness of some variants of the graph coloring game
Discrete Mathematics
2019-12-03 v1 Computational Complexity
Combinatorics
Abstract
Very recently, a long-standing open question proposed by Bodlaender in 1991 was answered: the graph coloring game is PSPACE-complete. In 2019, Andres and Lock proposed five variants of the graph coloring game and left open the question of PSPACE-hardness related to them. In this paper, we prove that these variants are PSPACE-complete for the graph coloring game and also for the greedy coloring game, even if the number of colors is the chromatic number. Finally, we also prove that a connected version of the graph coloring game, proposed by Charpentier et al. in 2019, is PSPACE-complete.
Keywords
Cite
@article{arxiv.1911.10363,
title = {Hardness of some variants of the graph coloring game},
author = {Thiago Marcilon and Nicolas Martins and Rudini Sampaio},
journal= {arXiv preprint arXiv:1911.10363},
year = {2019}
}
Comments
12 pages