Universality of the chip-firing game (Q1392019): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Disks, Balls, and Walls: Analysis of a Combinatorial Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel chip firing games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing games on directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chip-firing games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: No Polynomial Bound for the Chip Firing Game on Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability is decidable in the numbers game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3988646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games on line graphs and sand piles / rank
 
Normal rank
Property / cites work
 
Property / cites work: No polynomial bound for the period of the parallel chip firing game on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4837661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing vectors in the max norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Bound for a Chip Firing Game on Graphs / rank
 
Normal rank

Revision as of 13:22, 28 May 2024

scientific article
Language Label Description Also known as
English
Universality of the chip-firing game
scientific article

    Statements