Chipping away at the edges: how long does it take?

DOI10.4310/JOC.2012.V3.N1.A5MaRDI QIDQ353403zbMATHOpenAlexFDO

Authors O-Yeat Chan, Paweł Prałat

Publication date 12 July 2013

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/joc.2012.v3.n1.a5

zbMATH Keywords

Single-node traffic flow process, graph searching, chip-firing game

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Games on graphs (graph-theoretic aspects) (05C57) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Flow-firing processes
• Chip-firing games on graphs
• Parallel chip firing games on graphs
• Firing patterns in the parallel chip-firing game
• A variation on chip-firing: the diffusion game

Cited in

(2)

• On meteors, earthworms and wimps
• Meteor process on \({\mathbb Z}^d\)

This page was built for publication: Chipping away at the edges: how long does it take?

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