The following pages link to Chip-firing games on graphs (Q805639):
Displaying 50 items.
- On computation of Baker and Norine's rank on complete graphs (Q252840) (← links)
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs (Q276208) (← links)
- Dynamic graph models and their properties (Q276764) (← links)
- Divisors on graphs, binomial and monomial ideals, and cellular resolutions (Q284775) (← links)
- Game brush number (Q290091) (← links)
- Brushing with additional cleaning restrictions (Q300254) (← links)
- Riemann-Roch theory for graph orientations (Q509688) (← links)
- Strong emergence of wave patterns on Kadanoff sandpiles (Q528976) (← links)
- Chip-firing games on directed graphs (Q685991) (← links)
- A note on the Abelian sandpile in \(\mathbb Z^d\) (Q690719) (← links)
- A constant bound for the periods of parallel chip-firing games with many chips (Q707952) (← links)
- Random walks and flights over connected graphs and complex networks (Q718283) (← links)
- Hall-Littlewood symmetric functions via the chip-firing game (Q739065) (← links)
- Properties of chip-firing games on complete graphs (Q745934) (← links)
- On the sandpile group of regular trees (Q872040) (← links)
- Enumerating degree sequences in digraphs and a cycle--cocycle reversing system (Q875070) (← links)
- Abelian networks. II: Halting on all inputs (Q907072) (← links)
- Cleaning a network with brushes (Q930892) (← links)
- Markov chain methods for analyzing urban networks (Q960151) (← links)
- Growth rates and explosions in sandpiles (Q963284) (← links)
- \(G\)-parking functions, acyclic orientations and spanning trees (Q965998) (← links)
- Parallel cleaning of a network with brushes (Q968165) (← links)
- The sandpile group of a tree (Q1024299) (← links)
- A geometric approach to acyclic orientations (Q1047180) (← links)
- Enumerative questions on rooted weighted necklaces (Q1271869) (← links)
- Chip-firing and the critical group of a graph (Q1283502) (← links)
- No polynomial bound for the period of the parallel chip firing game on graphs (Q1349717) (← links)
- Chip firing and the Tutte polynomial (Q1387615) (← links)
- Universality of the chip-firing game (Q1392019) (← links)
- The sand-pile model and Tutte polynomials (Q1398285) (← links)
- Classes of lattices induced by chip firing (and sandpile) dynamics. (Q1404997) (← links)
- On the sandpile group of dual graphs (Q1568782) (← links)
- Source reversal and chip firing on graphs (Q1575961) (← links)
- Polynomial ideals for sandpiles and their Gröbner bases (Q1605301) (← links)
- On extreme points of the diffusion polytope (Q1620538) (← links)
- Chip-firing groups of iterated cones (Q1668984) (← links)
- Abelian sandpile model and Biggs-Merino polynomial for directed graphs (Q1679328) (← links)
- Computing linear systems on metric graphs (Q1690779) (← links)
- Spanning trees and recurrent configurations of a graph (Q1740077) (← links)
- Goldbug variations (Q1777515) (← links)
- The sandpile model on \(K_{m,n}\) and the rank of its configurations (Q1788340) (← links)
- A maximizing characteristic for critical configurations of chip-firing games on digraphs (Q1801042) (← links)
- The chip firing game on \(n\)-cycles (Q1805374) (← links)
- The Tutte polynomial as a growth function (Q1818371) (← links)
- Coding distributive lattices with Edge Firing Games. (Q1853051) (← 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)
- Critical groups of simplicial complexes (Q1950424) (← links)
- Integral flow and cycle chip-firing on graphs (Q1980996) (← links)
