Chip firing and the Tutte polynomial
From MaRDI portal
Publication:1387615
DOI10.1007/BF02558479zbMath0901.05004MaRDI QIDQ1387615
Publication date: 26 November 1998
Published in: Annals of Combinatorics (Search for Journal in Brave)
Related Items
Probabilizing parking functions ⋮ The distribution of sandpile groups of random graphs ⋮ Chip-firing game and a partial Tutte polynomial for Eulerian digraphs ⋮ Internally perfect matroids ⋮ Dynamic graph models and their properties ⋮ Divisors on graphs, binomial and monomial ideals, and cellular resolutions ⋮ Macdonald cumulants, \(G\)-inversion polynomials and \(G\)-parking functions ⋮ Tutte short exact sequences of graphs ⋮ Monomials, binomials and Riemann-Roch ⋮ A combinatorial formula for Macdonald cumulants ⋮ Fundamental constants in the theory of two-dimensional uniform spanning trees ⋮ Riemann-Roch and Abel-Jacobi theory on a finite graph ⋮ On the roots of all-terminal reliability polynomials ⋮ Unnamed Item ⋮ Enumerating degree sequences in digraphs and a cycle--cocycle reversing system ⋮ The Tutte polynomial of an infinite family of outerplanar, small-world and self-similar graphs ⋮ Extremal graphs for the Tutte polynomial ⋮ More connections between the matching polynomial and the chromatic polynomial ⋮ Fourientations and the Tutte polynomial ⋮ Abelian sandpile model and Biggs-Merino polynomial for directed graphs ⋮ Enumerating parking completions using join and split ⋮ On maximum graphs in Tutte polynomial posets ⋮ The sand-pile model and Tutte polynomials ⋮ \(G\)-parking functions and tree inversions ⋮ Combinatorial aspects of sandpile models on wheel and Fan graphs ⋮ On the structure of the \(h\)-vector of a paving matroid ⋮ Minimal configurations and sandpile measures ⋮ Experimental research on the welfare in a closed production network ⋮ On the number of circuit-cocircuit reversal classes of an oriented matroid ⋮ Spanning forests in regular planar maps ⋮ Computing the Tutte polynomial of lattice path matroids using determinantal circuits ⋮ Integral flow and cycle chip-firing on graphs ⋮ The Potts model and the Tutte polynomial ⋮ Decomposing recurrent states of the Abelian sandpile model ⋮ Decomposing recurrent states of the abelian sandpile model ⋮ Multiparking functions, graph searching, and the Tutte polynomial ⋮ \(G\)-parking functions, acyclic orientations and spanning trees ⋮ Quaternionic geometry of matroids ⋮ Sandpiles and dominos ⋮ A constant bound for the periods of parallel chip-firing games with many chips ⋮ Potts model partition functions on two families of fractal lattices ⋮ Sandpile models ⋮ A maximizing characteristic for critical configurations of chip-firing games on digraphs ⋮ Properties of chip-firing games on complete graphs ⋮ Restricted Tutte polynomials for some periodic oriented forests on infinite square lattice ⋮ The Tutte polynomial as a growth function ⋮ Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees ⋮ Chip firing and all-terminal network reliability bounds ⋮ Flow Polytopes and the Space of Diagonal Harmonics ⋮ A Note on Jacobians, Tutte Polynomials, and Two-Variable Zeta Functions of Graphs ⋮ The chip-firing game ⋮ Threshold state and a conjecture of Poghosyan, Poghosyan, Priezzhev and Ruelle ⋮ On computation of Baker and Norine's rank on complete graphs ⋮ Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs ⋮ The looping constant of Zd
Cites Work
