Akasaka, Kentaro; Ishibashi, Suguru; Yoshinaga, Masahiko Finite record sets of chip-firing games. (English) Zbl 07760452 Innov. Incidence Geom. 20, No. 1, 55-61 (2023). MSC: 05C57 91A43 PDF BibTeX XML Cite \textit{K. Akasaka} et al., Innov. Incidence Geom. 20, No. 1, 55--61 (2023; Zbl 07760452) Full Text: DOI arXiv
Bu, Alan; Choi, Yunseo; Xu, Max An exact bound on the number of chips of parallel chip-firing games that stabilize. (English) Zbl 1500.05042 Arch. Math. 119, No. 5, 471-478 (2022). MSC: 05C57 05C85 68R10 37B15 68Q25 68W05 91A43 PDF BibTeX XML Cite \textit{A. Bu} et al., Arch. Math. 119, No. 5, 471--478 (2022; Zbl 1500.05042) Full Text: DOI
Duong, Phan Thi Ha Brill-Noether conjecture on cactus graphs. (English) Zbl 1498.05146 Acta Math. Vietnam. 47, No. 4, 833-845 (2022). MSC: 05C38 14H25 14C20 68R10 PDF BibTeX XML Cite \textit{P. T. H. Duong}, Acta Math. Vietnam. 47, No. 4, 833--845 (2022; Zbl 1498.05146) Full Text: DOI
Kim, Jesse; Perkinson, David Simplicial dollar game. (English) Zbl 1491.05133 Electron. J. Comb. 29, No. 2, Research Paper P2.37, 32 p. (2022). MSC: 05C57 91A43 05E45 PDF BibTeX XML Cite \textit{J. Kim} and \textit{D. Perkinson}, Electron. J. Comb. 29, No. 2, Research Paper P2.37, 32 p. (2022; Zbl 1491.05133) Full Text: DOI arXiv
van Dobben de Bruyn, Josse; Smit, Harry; van der Wegen, Marieke Discrete and metric divisorial gonality can be different. (English) Zbl 1486.05201 J. Comb. Theory, Ser. A 189, Article ID 105619, 19 p. (2022). MSC: 05C57 05C62 91A43 14H25 14T99 PDF BibTeX XML Cite \textit{J. van Dobben de Bruyn} et al., J. Comb. Theory, Ser. A 189, Article ID 105619, 19 p. (2022; Zbl 1486.05201) Full Text: DOI arXiv
Merino, Criel; Ruiz, Verónica E. Nim-o-do: a game for everyone. (Spanish) Zbl 1479.05227 Misc. Mat. 71, 17-29 (2020). MSC: 05C57 91A43 91A05 91A46 00A08 PDF BibTeX XML Cite \textit{C. Merino} and \textit{V. E. Ruiz}, Misc. Mat. 71, 17--29 (2020; Zbl 1479.05227) Full Text: Link
Kayll, P. Mark; Perkins, Dave On lengths of burn-off chip-firing games. (English) Zbl 1466.05135 J. Comb. Math. Comb. Comput. 116, 53-77 (2020). MSC: 05C57 05C85 05C05 05C25 60J20 91A43 PDF BibTeX XML Cite \textit{P. M. Kayll} and \textit{D. Perkins}, J. Comb. Math. Comb. Comput. 116, 53--77 (2020; Zbl 1466.05135) Full Text: arXiv
Long, Jason; Narayanan, Bhargav Diffusion on graphs is eventually periodic. (English) Zbl 1403.05099 J. Comb. 10, No. 2, 235-241 (2019). MSC: 05C57 05C85 05C22 91A43 PDF BibTeX XML Cite \textit{J. Long} and \textit{B. Narayanan}, J. Comb. 10, No. 2, 235--241 (2019; Zbl 1403.05099) Full Text: DOI arXiv
Perkins, Dave; Kayll, P. Mark The length distribution for burn-off chip-firing games on complete graphs. (English) Zbl 1386.05118 Bull. Inst. Comb. Appl. 81, 78-97 (2017). MSC: 05C57 05C30 60C05 05C05 60F99 60J20 91A43 PDF BibTeX XML Cite \textit{D. Perkins} and \textit{P. M. Kayll}, Bull. Inst. Comb. Appl. 81, 78--97 (2017; Zbl 1386.05118)
Perrot, Kévin; van Pham, Trung Chip-firing game and a partial Tutte polynomial for Eulerian digraphs. (English) Zbl 1335.91023 Electron. J. Comb. 23, No. 1, Research Paper P1.57, 34 p. (2016). MSC: 91A43 05C57 91A46 05C20 05C31 05C45 PDF BibTeX XML Cite \textit{K. Perrot} and \textit{T. van Pham}, Electron. J. Comb. 23, No. 1, Research Paper P1.57, 34 p. (2016; Zbl 1335.91023) Full Text: arXiv Link
Kiss, Viktor; Tóthmérész, Lilla Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph. (English) Zbl 1317.05122 Discrete Appl. Math. 193, 48-56 (2015). MSC: 05C57 91A43 68Q17 PDF BibTeX XML Cite \textit{V. Kiss} and \textit{L. Tóthmérész}, Discrete Appl. Math. 193, 48--56 (2015; Zbl 1317.05122) Full Text: DOI arXiv
Perrot, Kévin; Pham, Trung Van Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs. (English) Zbl 1331.68095 Ann. Comb. 19, No. 2, 373-396 (2015). MSC: 68Q17 05C20 05C45 05C57 PDF BibTeX XML Cite \textit{K. Perrot} and \textit{T. Van Pham}, Ann. Comb. 19, No. 2, 373--396 (2015; Zbl 1331.68095) Full Text: DOI arXiv
Cori, Robert; Petrullo, Pasquale; Senato, Domenico Yamanouchi toppling – extended abstract. (English. French summary) Zbl 1393.05270 Proceedings of the 26th international conference on formal power series and algebraic combinatorics, FPSAC 2014, Chicago, IL, USA, June 29 – July 3, 2014. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 441-452 (2014). MSC: 05E05 05C57 05E10 33D80 PDF BibTeX XML Cite \textit{R. Cori} et al., in: Proceedings of the 26th international conference on formal power series and algebraic combinatorics, FPSAC 2014, Chicago, IL, USA, June 29 -- July 3, 2014. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS). 441--452 (2014; Zbl 1393.05270) Full Text: Link
Bonato, Anthony; Kinnersley, William B.; Prałat, Paweł Toppling numbers of complete and random graphs. (English) Zbl 1306.05154 Discrete Math. Theor. Comput. Sci. 16, No. 3, 229-252 (2014). MSC: 05C57 05C80 91A43 91A05 PDF BibTeX XML Cite \textit{A. Bonato} et al., Discrete Math. Theor. Comput. Sci. 16, No. 3, 229--252 (2014; Zbl 1306.05154) Full Text: arXiv Link
Cori, Robert; Phan, Thi Ha Duong; Tran, Thi Thu Huong Signed chip firing games and symmetric sandpile models on the cycles. (English) Zbl 1266.05098 RAIRO, Theor. Inform. Appl. 47, No. 2, 133-146 (2013). MSC: 05C57 91A43 68R15 68R10 PDF BibTeX XML Cite \textit{R. Cori} et al., RAIRO, Theor. Inform. Appl. 47, No. 2, 133--146 (2013; Zbl 1266.05098) Full Text: DOI Numdam
Chan, O-Yeat; Prałat, Paweł Chipping away at the edges: how long does it take? (English) Zbl 1269.05070 J. Comb. 3, No. 1, 101-121 (2012). MSC: 05C50 05C57 05C78 05C85 90B10 68R10 PDF BibTeX XML Cite \textit{O-Y. Chan} and \textit{P. Prałat}, J. Comb. 3, No. 1, 101--121 (2012; Zbl 1269.05070) Full Text: DOI
Messinger, Margaret-Ellen; Nowakowski, Richard J.; Prałat, Paweł Cleaning with brooms. (English) Zbl 1235.05094 Graphs Comb. 27, No. 2, 251-267 (2011). Reviewer: Haiko Müller (Leeds) MSC: 05C57 91A43 PDF BibTeX XML Cite \textit{M.-E. Messinger} et al., Graphs Comb. 27, No. 2, 251--267 (2011; Zbl 1235.05094) Full Text: DOI
Knauer, Kolja Chip-firing, antimatroids, and polyhedra. (English) Zbl 1272.05121 Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 9-13 (2009). MSC: 05C57 05B35 PDF BibTeX XML Cite \textit{K. Knauer}, Electron. Notes Discrete Math. 34, 9--13 (2009; Zbl 1272.05121) Full Text: DOI
Goles, Eric; Margenstern, Maurice Universality of the chip-firing game. (English) Zbl 0903.68138 Theor. Comput. Sci. 172, No. 1-2, 121-134 (1997). MSC: 68R10 91A46 PDF BibTeX XML Cite \textit{E. Goles} and \textit{M. Margenstern}, Theor. Comput. Sci. 172, No. 1--2, 121--134 (1997; Zbl 0903.68138) Full Text: DOI
Eriksson, Kimmo Node firing games on graphs. (English) Zbl 0819.90149 Barcelo, Hélène (ed.) et al., Jerusalem combinatorics ’93: an international conference in combinatorics, May 9-17, 1993, Jerusalem, Israel. Providence, RI: American Mathematical Society. Contemp. Math. 178, 117-127 (1994). MSC: 91A43 91A46 05C20 PDF BibTeX XML Cite \textit{K. Eriksson}, Contemp. Math. 178, 117--127 (1994; Zbl 0819.90149)
Tardos, Gábor Polynomial bound for a chip firing game on graphs. (English) Zbl 0652.68089 SIAM J. Discrete Math. 1, No. 3, 397-398 (1988). MSC: 68R10 68Q25 05C35 PDF BibTeX XML Cite \textit{G. Tardos}, SIAM J. Discrete Math. 1, No. 3, 397--398 (1988; Zbl 0652.68089) Full Text: DOI