Bollobás, B., Przykucki, M., Riordan, O. and Sahasrabudhe, J. 2017. On the Maximum Running Time in Graph Bootstrap Percolation. The Electronic Journal of Combinatorics. 24, 2 (May 2017), P2.16. DOI:https://doi.org/10.37236/5771.