Chip-firing games on mutating graphs

被引:13
|
作者
Eriksson, K
机构
[1] Department of Mathematics, Royal Institute of Technology
关键词
chip firing; eulerian graph; period length; game length;
D O I
10.1137/S0895480192240287
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页码:118 / 128
页数:11
相关论文
共 26 条