PSPACE-Completeness of Two Graph Coloring Games

Bonamy, M., & Bousquet, N. (2020). PSPACE-Completeness of Two Graph Coloring Games. Theoretical Computer Science, 824-825.

Type

Journal article

Intellectual base

Primary research

Year

2020

DOI

10.1016/j.tcs.2020.03.022

Link

https://doi.org/10.1016/j.tcs.2020.03.022

Cited by

1 citation across 1 artifact.

Domain-specific

• Graph Coloring Game
  • Later work resolved the long-open complexity question by proving hardness/completeness results for the game and variants.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:b3196560fb1d · see in the full table