Kaleidoscopic colorings of graphs. - Gary Chartrand; Sean English; Ping Zhang 004 (Discuss. Math. Graph Theory, 2017)

On Rainbow Hamilton Cycles in Random Hypergraphs. - Andrzej Dudek; Sean English; Alan M. Frieze (Electron. J. Comb., 2018)

Nearly-Regular Hypergraphs and Saturation of Berge Stars. - Bethany Austhof; Sean English (Electron. J. Comb., 2019)

On the Weight of Berge-F-Free Hypergraphs. - Sean English; Dániel Gerbner; Abhishek Methuku; Cory Palmer (Electron. J. Comb., 2019)

A Sublinear Bound on the Cop Throttling Number of a Graph. - Anthony Bonato; Sean English (CoRR, 2019)

Cop throttling number: Bounds, values, and variants. - Anthony Bonato; Jane Breen; Boris Brimkov; Joshua Carlson; Sean English; Jesse Geneson; Leslie Hogben; K. E. Perry; Carolyn Reinhart (CoRR, 2019)

The zero forcing polynomial of a graph. - Kirk Boyer; Boris Brimkov; Sean English; Daniela Ferrero; Ariel Keller; Rachel Kirsch; Michael Phillips; Carolyn Reinhart (Discret. Appl. Math., 2019)

Weighted Turán problems with applications. - Patrick Bennett; Sean English; Maria Talanda-Fisher (Discret. Math., 2019)

Saturation of Berge hypergraphs. - Sean English; Pamela Gordon; Nathan Graber; Abhishek Methuku; Eric Sullivan (Discret. Math., 2019)

Large monochromatic components and long monochromatic cycles in random hypergraphs. - Patrick Bennett; Louis DeBiasio; Andrzej Dudek; Sean English (Eur. J. Comb., 2019)

Linearity of saturation for Berge hypergraphs. - Sean English; Dániel Gerbner; Abhishek Methuku; Michael Tait (Eur. J. Comb., 2019)

A Random Variant of the Game of Plates and Olives. - Andrzej Dudek; Sean English; Alan M. Frieze (SIAM J. Discret. Math., 2019)

The iterated local model for social networks. - Anthony Bonato; Huda Chuangpishit; Sean English; Bill Kay; Erin Meger (Discret. Appl. Math., 2020)

Firefighting on the hexagonal grid. - Abdullah Dean; Sean English; Tongyun Huang; Robert A. Krueger; Andy Lee; Mose Mizrahi; Casey Wheaton-Werle (Discret. Appl. Math., 2021)

Probabilistic zero forcing on random graphs. - Sean English; Calum MacRury; Pawel Pralat (Eur. J. Comb., 2021)

Improved Bounds for Burning Fence Graphs. - Anthony Bonato; Sean English; Bill Kay; Daniel Moghbel (Graphs Comb., 2021)

Linear Bounds for Cycle-Free Saturation Games. - Sean English; Tomás Masarík; Grace McCourt; Erin Meger; Michael S. Ross; Sam Spiro (Electron. J. Comb., 2022)

Localization game for random graphs. - Andrzej Dudek; Sean English; Alan M. Frieze; Calum MacRury; Pawel Pralat (Discret. Appl. Math., 2022)

Lower bounds on the Erdős-Gyárfás problem via color energy graphs. - József Balogh; Sean English; Emily Heath; Robert A. Krueger (J. Graph Theory, 2023)

Saturation for the 3-uniform loose 3-cycle. - Sean English; Alexandr V. Kostochka; Dara Zirlin (Discret. Math., 2023)

Saturation numbers for Berge cliques. - Sean English; Jürgen Kritschgau; Mina Nahvi; Elizabeth Sprangel (Eur. J. Comb., 2024)

A Random Coloring Process Gives Improved Bounds for the Erdős-Gyárfás Problem on Generalized Ramsey Numbers. - Patrick Bennett; Andrzej Dudek; Sean English (Electron. J. Comb., 2025)

Understanding high-order network structure using permissible walks on attributed hypergraphs. - Audun Myers; Enzo Battistella; Sean English; Robert Green; Cliff A. Joslyn; Evgeniya Lagoda; Van Magnan; Evan D. Nash; Michael Robinson 001 (J. Complex Networks, 2025)

Rational Exponents for Cliques. - Sean English; Anastasia Halfpap; Robert A. Krueger (SIAM J. Discret. Math., 2025)

On the Constructor-Blocker game. - József Balogh; Ce Chen; Sean English (J. Graph Theory, 2025)