Universality of the chip-firing game

DOI10.1016/S0304-3975(95)00242-1zbMath0903.68138MaRDI QIDQ1392019

Maurice Margenstern, Eric Goles Chacc

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

chip-firing game on undirected graphs

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

91A46: Combinatorial games

Related Items

Motors and Impossible Firing Patterns in the Parallel Chip-Firing Game, Structure of some sand piles model, On Goles' universal machines: a computational point of view, Crossing information in two-dimensional sandpiles, Generalized communicating P systems, Sand piles models of signed partitions with \(d\) piles, Parallel rank of two sandpile models of signed integer partitions, Abelian Networks I. Foundations and Examples

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chip-firing games on directed graphs
• Chip-firing games on graphs
• Balancing vectors in the max norm
• Parallel chip firing games on graphs
• Games on line graphs and sand piles
• Reachability is decidable in the numbers game
• No polynomial bound for the period of the parallel chip firing game on graphs
• Disks, Balls, and Walls: Analysis of a Combinatorial Game
• Polynomial Bound for a Chip Firing Game on Graphs
• No Polynomial Bound for the Chip Firing Game on Directed Graphs