Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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)
Björner, A., Lovász, L., Shor, P.W.: Chip-firing games on graphs, Europ. J. Comb.12, 283–291 (1991)
Spencer, J.: Balancing vectors in the max norm, Combinatorica6, 55–66 (1986)
Tardos, G.: Polynomial bound for a chip firing game on graphs, Siam J. Disc. Math.1 (3, 397–398 (1988)
Author information
Authors and Affiliations
Additional information
This research was funded by NSERC operating grants.
Rights and permissions
About this article
Cite this article
Jeffs, J., Seager, S. The chip firing game onn-cycles. Graphs and Combinatorics 11, 59–67 (1995). https://doi.org/10.1007/BF01787422
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01787422