Games on interval and permutation graph representations

We describe combinatorial games on graphs in which two players antagonistically build a representation of a subgraph of a given graph. We show that for a large class of these games, determining whether a given instance is a winning position for the next player is PSPACE-hard. In contrast, we give polynomial time algorithms for solving some versions of the games on trees.

• Type: Journal
• Year: 2016
• Where: TCS
• Authors: Jessica Enright, Lorna Stewart
• Keywords: TCS 2016, Theoretical Computer Science