In this paper we present further studies of recurrent configurations of chip-firing games on
Eulerian directed graphs (simple digraphs), a class on the way from undirected graphs to …

The Chip-firing game is a discrete dynamical system played on a graph, in which chips
move along edges according to a simple local rule. Properties of the underlying graph are of …

We continue our study of burn-off chip-firing games on graphs initiated in [Discrete Math.
Theor. Comput. Sci. 15 (2013), no. 1, 121–132]. Here we introduce randomness by choosing …

Perfect vertex elimination schemes are part of the characterizations for several classes of
graphs, including chordal and cop-win. Partial elimination schemes reduce a graph to an …

Les modèles de pile de sable sont une sous-classe d'automates cellulaires. Bak et al. les
ont introduit en 1987 comme une illustration de la notion intuitive d'auto-organisation …

We give a survey of our works on the natural extensions of the wellknown Sand Pile Model.
These extensions consist of adding outside grains on random columns, allowing sand …

arXiv:1601.03038v1 [math.CO] 12 Jan 2016 Linear time algorithm for computing the rank of
divisors on cactus graphs Page 1 arXiv:1601.03038v1 [math.CO] 12 Jan 2016 Linear time …

The Chip Firing Game (CFG) is a discrete dynamical model which was first defined by A.
Björner, L. Lovász and W. Shor while studying the 'balancing game'[6, 7, 42]. The model has …