No Polynomial Bound for the Chip Firing Game on Directed Graphs

DOI10.2307/2048674zbMATH Open0758.05060OpenAlexW4245244543MaRDI QIDQ3974530FDOQ3974530

Kimmo Eriksson

Publication date: 25 June 1992

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

zbMATH Keywords

chip firing gamebounddirected graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

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

   Recommendations

• Polynomial Bound for a Chip Firing Game on Graphs 👍 👎
• Chip-firing games on directed graphs 👍 👎
• Algorithmic aspects of a chip-firing game 👍 👎
• No polynomial bound for the period of the parallel chip firing game on graphs 👍 👎
• Chip-firing games on graphs 👍 👎

This page was built for publication: No Polynomial Bound for the Chip Firing Game on Directed Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974530)