✦ LIBER ✦

Polynomial Bound for a Chip Firing Game on Graphs

✍ Scribed by Tardos, Gábor

Book ID: 115468904
Publisher: Society for Industrial and Applied Mathematics
Year: 1988
Tongue: English
Weight: 219 KB
Volume: 1
Category: Article
ISSN: 0895-4801
DOI: 10.1137/0401039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

No polynomial bound for the period of th

No polynomial bound for the period of the parallel chip firing game on graphs

✍ M.A. Kiwi; R. Ndoundam; M. Tchuente; E. Goles 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 229 KB

Parallel chip firing games on graphs

✍ Javier Bitar; Eric Goles 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 506 KB

Chip-firing games, potential theory on g

Chip-firing games, potential theory on graphs, and spanning trees

✍ Baker, Matthew; Shokrieh, Farbod 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 288 KB

A constant bound for the periods of para

A constant bound for the periods of parallel chip-firing games with many chips

✍ Paul Myer Kominers; Scott Duke Kominers 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 119 KB

Space bounds for a game on graphs

✍ Wolfgang J. Paul; Robert Endre Tarjan; James R. Celoni 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 824 KB

A bound for the game chromatic number of

A bound for the game chromatic number of graphs

✍ Thomas Dinski; Xuding Zhu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 580 KB

We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic number of these classes of graphs. In particula