Three formulas compute the minimum initial chips for an infinite chip-firing game on strongly connected directed loop-free multigraphs, generalizing the Eulerian case.
(1991),Chip-firing games on graphs, Eur
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Winning probabilities in Pass the Buck on complete binary and k-ary trees are computed using the Stochastic Abacus.
citing papers explorer
-
General formulas for the instability minimum of Chip-firing games
Three formulas compute the minimum initial chips for an infinite chip-firing game on strongly connected directed loop-free multigraphs, generalizing the Eulerian case.
-
Pass the Buck on a Complete Binary Tree
Winning probabilities in Pass the Buck on complete binary and k-ary trees are computed using the Stochastic Abacus.