The chip firing game onn-cycles
- 55 Downloads
Spencer introduced a chip firing game on a line, which was generalized by Björner, Lovasz and Shor to graphs. This paper characterizes those configurations which may be repeated in a game, and analyzes the game forn-cycles.
Unable to display preview. Download preview PDF.
- 1.Anderson, R.J., Lovász, L., Shor, P.W., Spencer, J., Tardos, É., Winograd, S.: Disks, balls and walls: analysis of a combinatorial game, Amer. Math. Monthly96 (6, 481–493 (1989)Google Scholar
- 2.Björner, A., Lovász, L., Shor, P.W.: Chip-firing games on graphs, Europ. J. Comb.12, 283–291 (1991)Google Scholar
- 3.Spencer, J.: Balancing vectors in the max norm, Combinatorica6, 55–66 (1986)Google Scholar
- 4.Tardos, G.: Polynomial bound for a chip firing game on graphs, Siam J. Disc. Math.1 (3, 397–398 (1988)Google Scholar