Pages that link to "Item:Q1387615"
From MaRDI portal
The following pages link to Chip firing and the Tutte polynomial (Q1387615):
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)
- Fundamental constants in the theory of two-dimensional uniform spanning trees (Q314929) (← links)
- On the structure of the \(h\)-vector of a paving matroid (Q449206) (← links)
- Minimal configurations and sandpile measures (Q457097) (← links)
- Spanning forests in regular planar maps (Q491963) (← links)
- Computing the Tutte polynomial of lattice path matroids using determinantal circuits (Q496045) (← links)
- Decomposing recurrent states of the abelian sandpile model (Q510551) (← links)
- A constant bound for the periods of parallel chip-firing games with many chips (Q707952) (← links)
- Properties of chip-firing games on complete graphs (Q745934) (← links)
- Enumerating degree sequences in digraphs and a cycle--cocycle reversing system (Q875070) (← links)
- \(G\)-parking functions, acyclic orientations and spanning trees (Q965998) (← links)
- Chip firing and all-terminal network reliability bounds (Q1040088) (← links)
- The sand-pile model and Tutte polynomials (Q1398285) (← links)
- Macdonald cumulants, \(G\)-inversion polynomials and \(G\)-parking functions (Q1623876) (← links)
- The Tutte polynomial of an infinite family of outerplanar, small-world and self-similar graphs (Q1673211) (← links)
- Abelian sandpile model and Biggs-Merino polynomial for directed graphs (Q1679328) (← links)
- \(G\)-parking functions and tree inversions (Q1705818) (← links)
- On the number of circuit-cocircuit reversal classes of an oriented matroid (Q1727778) (← links)
- Decomposing recurrent states of the Abelian sandpile model (Q1745095) (← links)
- Quaternionic geometry of matroids (Q1767431) (← links)
- Potts model partition functions on two families of fractal lattices (Q1783100) (← links)
- Sandpile models (Q1786476) (← links)
- A maximizing characteristic for critical configurations of chip-firing games on digraphs (Q1801042) (← links)
- The Tutte polynomial as a growth function (Q1818371) (← links)
- Integral flow and cycle chip-firing on graphs (Q1980996) (← links)
- More connections between the matching polynomial and the chromatic polynomial (Q2176164) (← links)
- Enumerating parking completions using join and split (Q2188834) (← links)
- Sandpiles and dominos (Q2263783) (← links)
- Restricted Tutte polynomials for some periodic oriented forests on infinite square lattice (Q2306515) (← links)
- Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees (Q2318776) (← links)
- Threshold state and a conjecture of Poghosyan, Poghosyan, Priezzhev and Ruelle (Q2339177) (← links)
- Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284) (← links)
- Probabilizing parking functions (Q2360728) (← links)
- Internally perfect matroids (Q2363096) (← links)
- Monomials, binomials and Riemann-Roch (Q2376291) (← links)
- Riemann-Roch and Abel-Jacobi theory on a finite graph (Q2383008) (← links)
- On the roots of all-terminal reliability polynomials (Q2400560) (← links)
- Fourientations and the Tutte polynomial (Q2408990) (← links)
- Multiparking functions, graph searching, and the Tutte polynomial (Q2474265) (← links)
- The chip-firing game (Q2575794) (← links)
- A combinatorial formula for Macdonald cumulants (Q2632680) (← links)
- Extremal graphs for the Tutte polynomial (Q2664552) (← links)
- Combinatorial aspects of sandpile models on wheel and Fan graphs (Q2700973) (← links)
- The Potts model and the Tutte polynomial (Q2737867) (← links)
- The looping constant of Z<sup>d</sup> (Q2877765) (← links)
- (Q4704790) (← links)
- Tutte short exact sequences of graphs (Q5051362) (← links)