Chip-Firing Games on Mutating Graphs

We investigate a generalization of a chip-firing game on a graph of Bjorner, Lovasz, and Shor [European J. Combin., 1 (1992), pp. 305--328]. In our version, the graph mutates during play. We show that some known results about the game length and period length of the earlier game hold for the mutating version as well, and some completely new bounds are also obtained. In a small detour, we treat an orientability concept for eulerian graphs.