Universality of the chip-firing game
type: Item
instance of: scholarly article
title: Universality of the chip-firing game
zbMATH Open document ID: 0903.68138
DOI: 10.1016/S0304-3975(95)00242-1
author: M. Margenstern
author: Eric Goles
published in: Theoretical Computer Science
publication date: 1998-07-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 91A46
zbMATH DE Number: 1178692
zbMATH Keywords: chip-firing game on undirected graphs
MaRDI profile type: Publication
cites work: Disks, Balls, and Walls: Analysis of a Combinatorial Game
cites work: Parallel chip firing games on graphs
cites work: Chip-firing games on directed graphs
cites work: Chip-firing games on graphs
cites work: No Polynomial Bound for the Chip Firing Game on Directed Graphs
cites work: Reachability is decidable in the numbers game
cites work: Q5560675
cites work: Q3988646
cites work: Games on line graphs and sand piles
cites work: No polynomial bound for the period of the parallel chip firing game on graphs
cites work: Q5590814
cites work: Q4837661
cites work: Q5573961
cites work: Balancing vectors in the max norm
cites work: Polynomial Bound for a Chip Firing Game on Graphs
full work available at URL: s0304-3975(95)00242-1
OpenAlex ID: W1975223568
description: scientific article; zbMATH DE number 1178692