The following pages link to Chip-firing games on graphs (Q805639):
Displaying 50 items.
- A chip-firing game and Dirichlet eigenvalues (Q1850017) (← links)
- Coding distributive lattices with Edge Firing Games. (Q1853051) (← links)
- Characterization of simple edge-firing games. (Q1853145) (← links)
- Sandpile models and lattices: a comprehensive survey (Q1885925) (← links)
- The numbers game and Coxeter groups (Q1893985) (← links)
- \textsc{polish} -- Let us play the cleaning game (Q1929225) (← links)
- Lattices generated by chip firing game models: criteria and recognition algorithms (Q1943390) (← links)
- Critical groups of simplicial complexes (Q1950424) (← links)
- Integral flow and cycle chip-firing on graphs (Q1980996) (← links)
- Computing graph gonality is hard (Q2004086) (← links)
- The abelian sandpile model on randomly rooted graphs and self-similar groups (Q2017122) (← links)
- The sandpile group of a family of nearly complete graphs (Q2021647) (← links)
- Confluence in labeled chip-firing (Q2062752) (← links)
- Rotor-routing reachability is easy, chip-firing reachability is hard (Q2066002) (← links)
- On the scramble number of graphs (Q2074355) (← links)
- Brill-Noether conjecture on cactus graphs (Q2080340) (← links)
- An exact bound on the number of chips of parallel chip-firing games that stabilize (Q2085558) (← links)
- A survey on the stability of (extended) linear Sand Pile model (Q2086732) (← links)
- Growth of replacements (Q2094883) (← links)
- Discrete and metric divisorial gonality can be different (Q2120835) (← links)
- The Bhargava greedoid (Q2199839) (← links)
- Results in labeled chip-firing (Q2199887) (← links)
- Treewidth is a lower bound on graph gonality (Q2200865) (← links)
- Compatible recurrent identities of the sandpile group and maximal stable configurations (Q2208354) (← links)
- Characterizing immutable sandpiles: a first look (Q2237231) (← links)
- Mean curvature, threshold dynamics, and phase field theory on finite graphs (Q2254953) (← links)
- Chip-firing and energy minimization on M-matrices (Q2258897) (← links)
- On graph parameters guaranteeing fast sandpile diffusion (Q2260617) (← links)
- Resource network with limited capacity of attractor vertices (Q2290392) (← links)
- Root system chip-firing. I: Interval-firing (Q2312841) (← links)
- Discrete balayage and boundary sandpile (Q2330786) (← links)
- Directed nonabelian sandpile models on trees (Q2339194) (← links)
- Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph (Q2354726) (← links)
- Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284) (← links)
- Riemann-Roch and Abel-Jacobi theory on a finite graph (Q2383008) (← links)
- Spectrally optimized pointset configurations (Q2402876) (← links)
- Chip-firing based methods in the Riemann-Roch theory of directed graphs (Q2422214) (← links)
- Fixed-point forms of the parallel symmetric sandpile model (Q2446102) (← links)
- Brushing without capacity restrictions (Q2449081) (← links)
- Strict partitions and discrete dynamical systems (Q2465628) (← links)
- On the sandpile group of the graph \(K_{3}\times C_n\) (Q2479502) (← links)
- Characterizations of polygreedoids and poly-antimatroids by greedy algorithms (Q2488235) (← links)
- The chip-firing game (Q2575794) (← links)
- Root system chip-firing (Q2632666) (← links)
- Combinatorial aspects of sandpile models on wheel and Fan graphs (Q2700973) (← links)
- The Potts model and the Tutte polynomial. (Q2737867) (← links)
- Algorithmic aspects of a chip-firing game (Q2777901) (← links)
- CoEulerian graphs (Q2802106) (← links)
- Abelian networks. I: Foundations and examples (Q2804993) (← links)
- Chip firing on general invertible matrices (Q2808165) (← links)
