Back to Results
First PageMeta Content
Matroid theory / Polynomials / Tutte polynomial / Degree / Tree / NP-complete problems / Path decomposition / Handshaking lemma / Graph theory / Mathematics / Theoretical computer science


A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips Paul Myer Kominers and Scott Duke Kominers Abstract. We prove that any parallel chip-firing game on a graph G with at least 4|E(G)| − |V (G
Add to Reading List

Document Date: 2011-12-29 23:15:14


Open Document

File Size: 110,34 KB

Share Result on Facebook
UPDATE