Pages that link to "Item:Q3974530"
From MaRDI portal
The following pages link to No Polynomial Bound for the Chip Firing Game on Directed Graphs (Q3974530):
Displaying 14 items.
- Order structure and energy of conflicting chip firing game (Q629747) (← links)
- Chip-firing games on directed graphs (Q685991) (← links)
- Chip-firing games on graphs (Q805639) (← links)
- On the sandpile group of regular trees (Q872040) (← 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)
- On a game in directed graphs. (Q1853026) (← links)
- Sandpile models and lattices: a comprehensive survey (Q1885925) (← links)
- Strong convergence and the polygon property of 1-player games (Q1917518) (← links)
- An exact bound on the number of chips of parallel chip-firing games that stabilize (Q2085558) (← links)
- Growth of replacements (Q2094883) (← links)
- The chip-firing game (Q2575794) (← links)
- CoEulerian graphs (Q2802106) (← links)
- Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three (Q4555049) (← links)