Please use this identifier to cite or link to this item: http://repositorio.ufla.br/jspui/handle/1/48147
Title: PSPACE-hardness of Two Graph Coloring Games
Keywords: Coloring game
Game chromatic number
Greedy coloring
Grundy number
PSPACE-hardness
Jogos de colorir
Número cromático do jogo
Número Grundy
Issue Date: 30-Aug-2019
Publisher: Elsevier
Citation: COSTA, E. et al. PSPACE-hardness of Two Graph Coloring Games. Electronic Notes in Theoretical Computer Science, [S. l.], v. 346, p. 333-344, 30 Aug. 2019. DOI: 10.1016/j.entcs.2019.08.030.
Abstract: In this paper, we answer a long-standing open question proposed by Bodlaender in 1991: the game chromatic number is PSPACE-hard. We also prove that the game Grundy number is PSPACE-hard. In fact, we prove that both problems (the graph coloring game and the greedy coloring game) are PSPACE-Complete even if the number of colors is the chromatic number. Despite this, we prove that the game Grundy number is equal to the chromatic number for several superclasses of cographs, extending a result of Havet and Zhu in 2013.
URI: http://repositorio.ufla.br/jspui/handle/1/48147
Appears in Collections:DCC - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_PSPACE-hardness of Two Graph Coloring Games.pdf243,31 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons

Admin Tools