Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 437298 (Why is no real title available?)
- scientific article; zbMATH DE number 3649800 (Why is no real title available?)
- scientific article; zbMATH DE number 67324 (Why is no real title available?)
- scientific article; zbMATH DE number 67325 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 1295362 (Why is no real title available?)
- scientific article; zbMATH DE number 510847 (Why is no real title available?)
- scientific article; zbMATH DE number 1741027 (Why is no real title available?)
- scientific article; zbMATH DE number 1152901 (Why is no real title available?)
- scientific article; zbMATH DE number 863495 (Why is no real title available?)
- A Contribution to the Theory of Chromatic Polynomials
- A chip-firing game and Dirichlet eigenvalues
- A finite group attached to the laplacian of a graph
- Algebraic aspects of Abelian sandpile models
- Balancing games
- Balancing vectors in the max norm
- Chip firing and the Tutte polynomial
- Chip-Firing Games on Mutating Graphs
- Chip-firing and the critical group of a graph
- Chip-firing games on directed graphs
- Chip-firing games on graphs
- Combinatorics and commutative algebra.
- Disks, Balls, and Walls: Analysis of a Combinatorial Game
- Greedoids
- Introduction to Greedoids
- No Polynomial Bound for the Chip Firing Game on Directed Graphs
- On the sandpile group of dual graphs
- Parallel chip firing games on graphs
- Polynomial Bound for a Chip Firing Game on Graphs
- Polynomial ideals for sandpiles and their Gröbner bases
- Self-organized critical state of sandpile automaton models
- Self-organized criticality
- The Potts model and the Tutte polynomial.
- The Tutte polynomial as a growth function
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- The probabilistic abacus
- The sand-pile model and Tutte polynomials
- Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes
- Vector balancing games with aging
Cited in
(50)- Multicommodity allocation for dynamic demands using PageRank vectors
- Some statistics about tropical sandpile model
- A maximizing characteristic for critical configurations of chip-firing games on digraphs
- Distance ideals of graphs
- The structure of a linear chip firing game and related models
- Chip firing on general invertible matrices
- Graphs whose critical groups have larger rank
- Order structure and energy of conflicting chip firing game
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs
- Spanning trees and recurrent configurations of a graph
- Chip-firing games on directed graphs
- Computing graph gonality is hard
- Addition of recurrent configurations in chip firing games: finding minimal recurrent configurations with Markov chains
- Critical ideals of signed graphs with twin vertices
- Small clique number graphs with three trivial critical ideals
- The multivariate avalanche polynomial
- A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case
- Yamanouchi toppling -- extended abstract
- Divisors and sandpiles. An introduction to chip-firing
- On the proportion of metric matroids whose Jacobians have nontrivial \(p\)-torsion
- Graphs with few trivial characteristic ideals
- Codeterminantal graphs
- Counting spanning trees in self-similar networks by evaluating determinants
- Firing patterns in the parallel chip-firing game
- Properties of chip-firing games on complete graphs
- A chip-firing game and Dirichlet eigenvalues
- Token graphs
- The structure of sandpile groups of outerplanar graphs
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Anisotropic higher rank \(\mathbb{Z}_N\) topological phases on graphs
- On graphs with 2 trivial distance ideals
- Chip-firing games and critical groups
- The chip-firing game and the sandpile model
- Hall-Littlewood symmetric functions via the chip-firing game
- Algorithmic aspects of a chip-firing game
- Graphs with few trivial critical ideals
- A family of matrix-tree multijections
- Critical ideals, minimum rank and zero forcing number
- Chip firing and algebraic curves
- Graphs with two trivial critical ideals
- The sandpile model on \(K_{m,n}\) and the rank of its configurations
- Digraphs with at most one trivial critical ideal
- Treewidth is a lower bound on graph gonality
- Chip-firing groups of iterated cones
- Graphs with real algebraic co-rank at most two
- Game brush number
- Chip-firing, antimatroids, and polyhedra
- scientific article; zbMATH DE number 6909294 (Why is no real title available?)
- Brushing with additional cleaning restrictions
- The mathematics of chip-firing
This page was built for publication: The chip-firing game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575794)
