Feedback game on Eulerian graphs

Abstract

In this paper, we introduce a two-player impartial game on graphs, called a {\em feedback game}, which is a variant of the generalized geography. We study the feedback game on Eulerian graphs. In particular, we show that the PSPACE-completeness of the game and determine the winner of the game on several classes of Eulerian graphs.

16 pages, 12 figures

Cited by in corpus (1)

• Feedback game on $3$-chromatic Eulerian triangulations of surfaces