The chip-firing game
From MaRDI portal
Publication:2575794
DOI10.1016/J.DISC.2004.07.033zbMath1139.91314OpenAlexW2020915184MaRDI QIDQ2575794
Publication date: 6 December 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.033
Applications of graph theory (05C90) Games involving graphs (91A43) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chip-firing games on directed graphs
- Chip-firing games on graphs
- Greedoids
- Balancing vectors in the max norm
- A finite group attached to the laplacian of a graph
- Parallel chip firing games on graphs
- The probabilistic abacus
- Balancing games
- Chip-firing and the critical group of a graph
- Chip firing and the Tutte polynomial
- The sand-pile model and Tutte polynomials
- On the sandpile group of dual graphs
- Polynomial ideals for sandpiles and their Gröbner bases
- The Tutte polynomial as a growth function
- A chip-firing game and Dirichlet eigenvalues
- Combinatorics and commutative algebra.
- The Potts model and the Tutte polynomial
- Self-organized criticality
- Disks, Balls, and Walls: Analysis of a Combinatorial Game
- Polynomial Bound for a Chip Firing Game on Graphs
- No Polynomial Bound for the Chip Firing Game on Directed Graphs
- Introduction to Greedoids
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes
- Self-organized critical state of sandpile automaton models
- Chip-Firing Games on Mutating Graphs
- Algebraic aspects of Abelian sandpile models
- A Contribution to the Theory of Chromatic Polynomials
- Vector balancing games with aging
Related Items (33)
Chip-firing game and a partial Tutte polynomial for Eulerian digraphs ⋮ Game brush number ⋮ Brushing with additional cleaning restrictions ⋮ Small clique number graphs with three trivial critical ideals ⋮ Riemann-Roch and Abel-Jacobi theory on a finite graph ⋮ Graphs with few trivial critical ideals ⋮ Codeterminantal graphs ⋮ Graphs with real algebraic co-rank at most two ⋮ On graphs with 2 trivial distance ideals ⋮ The structure of sandpile groups of outerplanar graphs ⋮ A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case ⋮ Token graphs ⋮ Treewidth is a lower bound on graph gonality ⋮ Graphs with two trivial critical ideals ⋮ Graphs whose critical groups have larger rank ⋮ Digraphs with at most one trivial critical ideal ⋮ Graphs with few trivial characteristic ideals ⋮ Spanning trees and recurrent configurations of a graph ⋮ Critical ideals of signed graphs with twin vertices ⋮ Computing graph gonality is hard ⋮ Critical ideals, minimum rank and zero forcing number ⋮ The sandpile model on \(K_{m,n}\) and the rank of its configurations ⋮ Some statistics about tropical sandpile model ⋮ Anisotropic higher rank \(\mathbb{Z}_N\) topological phases on graphs ⋮ A maximizing characteristic for critical configurations of chip-firing games on digraphs ⋮ On the proportion of metric matroids whose Jacobians have nontrivial \(p\)-torsion ⋮ Properties of chip-firing games on complete graphs ⋮ A family of matrix-tree multijections ⋮ Multicommodity Allocation for Dynamic Demands Using PageRank Vectors ⋮ Unnamed Item ⋮ Distance ideals of graphs ⋮ Chip-Firing, Antimatroids, and Polyhedra ⋮ Counting spanning trees in self-similar networks by evaluating determinants
This page was built for publication: The chip-firing game
