Col is PSPACE-complete on Triangular Grids
Computational Complexity
2025-01-28 v2 Combinatorics
Abstract
We demonstrate that Col is PSPACE-complete on triangular grid graphs via a reduction from Bounded Two-Player Constraint Logic. This is the most structured graph family that Col is known to be computationally hard for.
Cite
@article{arxiv.2501.06574,
title = {Col is PSPACE-complete on Triangular Grids},
author = {Kyle Burke and Craig Tennenhouse},
journal= {arXiv preprint arXiv:2501.06574},
year = {2025}
}
Comments
10 pages, 16 figures