Chip firing and the Tutte polynomial

From MaRDI portal
Revision as of 15:49, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1387615

DOI10.1007/BF02558479zbMath0901.05004MaRDI QIDQ1387615

Criel Merino López

Publication date: 26 November 1998

Published in: Annals of Combinatorics (Search for Journal in Brave)




Related Items (55)

Probabilizing parking functionsThe distribution of sandpile groups of random graphsChip-firing game and a partial Tutte polynomial for Eulerian digraphsInternally perfect matroidsDynamic graph models and their propertiesDivisors on graphs, binomial and monomial ideals, and cellular resolutionsMacdonald cumulants, \(G\)-inversion polynomials and \(G\)-parking functionsTutte short exact sequences of graphsMonomials, binomials and Riemann-RochA combinatorial formula for Macdonald cumulantsFundamental constants in the theory of two-dimensional uniform spanning treesRiemann-Roch and Abel-Jacobi theory on a finite graphOn the roots of all-terminal reliability polynomialsUnnamed ItemEnumerating degree sequences in digraphs and a cycle--cocycle reversing systemThe Tutte polynomial of an infinite family of outerplanar, small-world and self-similar graphsExtremal graphs for the Tutte polynomialMore connections between the matching polynomial and the chromatic polynomialFourientations and the Tutte polynomialAbelian sandpile model and Biggs-Merino polynomial for directed graphsEnumerating parking completions using join and splitOn maximum graphs in Tutte polynomial posetsThe sand-pile model and Tutte polynomials\(G\)-parking functions and tree inversionsCombinatorial aspects of sandpile models on wheel and Fan graphsOn the structure of the \(h\)-vector of a paving matroidMinimal configurations and sandpile measuresExperimental research on the welfare in a closed production networkOn the number of circuit-cocircuit reversal classes of an oriented matroidSpanning forests in regular planar mapsComputing the Tutte polynomial of lattice path matroids using determinantal circuitsIntegral flow and cycle chip-firing on graphsThe Potts model and the Tutte polynomialDecomposing recurrent states of the Abelian sandpile modelDecomposing recurrent states of the abelian sandpile modelMultiparking functions, graph searching, and the Tutte polynomial\(G\)-parking functions, acyclic orientations and spanning treesQuaternionic geometry of matroidsSandpiles and dominosA constant bound for the periods of parallel chip-firing games with many chipsPotts model partition functions on two families of fractal latticesSandpile modelsA maximizing characteristic for critical configurations of chip-firing games on digraphsProperties of chip-firing games on complete graphsRestricted Tutte polynomials for some periodic oriented forests on infinite square latticeThe Tutte polynomial as a growth functionPermutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary treesChip firing and all-terminal network reliability boundsFlow Polytopes and the Space of Diagonal HarmonicsA Note on Jacobians, Tutte Polynomials, and Two-Variable Zeta Functions of GraphsThe chip-firing gameThreshold state and a conjecture of Poghosyan, Poghosyan, Priezzhev and RuelleOn computation of Baker and Norine's rank on complete graphsFeedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphsThe looping constant of Zd




Cites Work




This page was built for publication: Chip firing and the Tutte polynomial