No Polynomial Bound for the Chip Firing Game on Directed Graphs

DOI10.2307/2048674MaRDI QIDQ3974530zbMATH OpenOpenAlexFDO

Authors 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)

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

Cites work

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

Cited in

(16)

• Universality of the chip-firing game
• Chip-firing games on directed graphs
• On the sandpile group of regular trees
• Toppling numbers of complete and random graphs
• Sandpile models and lattices: a comprehensive survey
• scientific article; zbMATH DE number 2086679 (Why is no real title available?)
• Order structure and energy of conflicting chip firing game
• The chip-firing game
• On a game in directed graphs.
• CoEulerian graphs
• 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
• Polynomial Bound for a Chip Firing Game on Graphs
• An exact bound on the number of chips of parallel chip-firing games that stabilize
• Mozes' game of numbers on directed graphs
• Growth of replacements

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)