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… (More)
DOI: 10.1016/j.tcs.2015.09.009


4 Figures and Tables