The following pages link to The chip-firing game (Q2575794):
Displaying 27 items.
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs (Q276208) (← links)
- Game brush number (Q290091) (← links)
- Brushing with additional cleaning restrictions (Q300254) (← links)
- Graphs with few trivial critical ideals (Q324860) (← links)
- Critical ideals of signed graphs with twin vertices (Q515809) (← links)
- Graphs whose critical groups have larger rank (Q644604) (← links)
- Properties of chip-firing games on complete graphs (Q745934) (← links)
- Small clique number graphs with three trivial critical ideals (Q1642901) (← links)
- Graphs with real algebraic co-rank at most two (Q1668987) (← links)
- Spanning trees and recurrent configurations of a graph (Q1740077) (← 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)
- Token graphs (Q1926040) (← links)
- Computing graph gonality is hard (Q2004086) (← links)
- A family of matrix-tree multijections (Q2065707) (← links)
- Codeterminantal graphs (Q2154283) (← links)
- On graphs with 2 trivial distance ideals (Q2174093) (← links)
- A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case (Q2178362) (← links)
- Treewidth is a lower bound on graph gonality (Q2200865) (← links)
- Graphs with few trivial characteristic ideals (Q2229515) (← links)
- Critical ideals, minimum rank and zero forcing number (Q2279368) (← links)
- Distance ideals of graphs (Q2332421) (← links)
- Riemann-Roch and Abel-Jacobi theory on a finite graph (Q2383008) (← links)
- Graphs with two trivial critical ideals (Q2440097) (← links)
- The structure of sandpile groups of outerplanar graphs (Q2663821) (← links)
- Chip-Firing, Antimatroids, and Polyhedra (Q2851431) (← links)
- Counting spanning trees in self-similar networks by evaluating determinants (Q2851758) (← links)
