586 research outputs found
On the Complexity of the Mis\`ere Version of Three Games Played on Graphs
We investigate the complexity of finding a winning strategy for the mis\`ere
version of three games played on graphs : two variants of the game
, introduced by Stockmann in 2004 and the game on both directed and undirected graphs. We show that on general
graphs those three games are -Hard or Complete. For one
-Hard variant of , we find an algorithm to compute
an effective winning strategy in time when
is a bipartite graph
- …