Pages that link to "Item:Q3798269"
From MaRDI portal
The following pages link to Polynomial Bound for a Chip Firing Game on Graphs (Q3798269):
Displaying 30 items.
- On the complexity of sandpile critical avalanches (Q549714) (← links)
- Chip-firing games on directed graphs (Q685991) (← 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)
- Chip-firing games on graphs (Q805639) (← links)
- On the sandpile group of regular trees (Q872040) (← links)
- Abelian networks. II: Halting on all inputs (Q907072) (← links)
- Parallel chip firing games on graphs (Q1184999) (← links)
- No polynomial bound for the period of the parallel chip firing game on graphs (Q1349717) (← links)
- Universality of the chip-firing game (Q1392019) (← links)
- Source reversal and chip firing on graphs (Q1575961) (← links)
- Abelian sandpile model and Biggs-Merino polynomial for directed graphs (Q1679328) (← links)
- The chip firing game on \(n\)-cycles (Q1805374) (← links)
- An exact bound on the number of chips of parallel chip-firing games that stabilize (Q2085558) (← links)
- Compatible recurrent identities of the sandpile group and maximal stable configurations (Q2208354) (← links)
- On graph parameters guaranteeing fast sandpile diffusion (Q2260617) (← links)
- Riemann-Roch and Abel-Jacobi theory on a finite graph (Q2383008) (← links)
- The chip-firing game (Q2575794) (← links)
- CoEulerian graphs (Q2802106) (← links)
- On the Complexity of Sandpile Prediction Problems (Q2811962) (← links)
- No Polynomial Bound for the Chip Firing Game on Directed Graphs (Q3974530) (← links)
- (Q3988646) (← links)
- Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three (Q4555049) (← links)
- The Complexity of Three-Dimensional Critical Avalanches (Q4931204) (← links)
- Gonality Sequences of Graphs (Q4986811) (← links)
- Abelian Logic Gates (Q5222545) (← links)
- Random Walks, Electric Networks and The Transience Class problem of Sandpiles (Q5743503) (← links)
- Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models (Q5886821) (← links)
- Recognizing hyperelliptic graphs in polynomial time (Q5919531) (← links)
- On approximating the rank of graph divisors (Q6098103) (← links)
