No Polynomial Bound for the Chip Firing Game on Directed Graphs

DOI10.2307/2048674zbMath0758.05060OpenAlexW4245244543MaRDI QIDQ3974530

Kimmo Eriksson

Publication date: 25 June 1992

Full work available at URL: https://doi.org/10.2307/2048674

zbMATH Keywords

bounddirected graphschip firing game

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items

Sandpile models and lattices: a comprehensive survey ⋮ No polynomial bound for the period of the parallel chip firing game on graphs ⋮ Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three ⋮ On the sandpile group of regular trees ⋮ Universality of the chip-firing game ⋮ Chip-firing games on directed graphs ⋮ CoEulerian graphs ⋮ The chip-firing game

Cites Work

• Chip-firing games on graphs
• Polynomial Bound for a Chip Firing Game on Graphs