CHIP-FIRING GAMES ON MUTATING GRAPHS

We investigate a generalization of a chip-firing game on a graph of Bj orner, 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 h old for the mutating version as well, and some completely new bounds a re also obtained. In a small detour, we treat an orientability concept for eulerian graphs.