Graphs with the fewest matchings. - Lauren Keough; Andrew John Radcliffe (Comb., 2016)

Extremal Threshold Graphs for Matchings and Independent Sets. - Lauren Keough; A. J. Radcliffe (Graphs Comb., 2018)

k-foldability of words. - Beth Bjorkman; Garner Cochran; Wei Gao; Lauren Keough; Rachel Kirsch; Mitch Phillipson; Danny Rorabaugh; Heather C. Smith; Jennifer Wise (Discret. Appl. Math., 2019)

Independent sets in n-vertex k-chromatic ℓ-connected graphs. - John Engbers; Lauren Keough; Taylor Short (Discret. Math., 2021)

Maximizing $2$-Independents Sets in $3$-Uniform Hypergraphs. - Lauren Keough; Jamie Radcliffe (Electron. J. Comb., 2022)

Symmetry parameters of various hypercube families. - Debra L. Boutin; Sally Cockburn; Lauren Keough; Sarah Loeb; Puck Rombach (Art Discret. Appl. Math., 2022)

Determining number and cost of generalized Mycielskian graphs. - Debra L. Boutin; Sally Cockburn; Lauren Keough; Sarah Loeb; K. E. Perry; Puck Rombach (Discuss. Math. Graph Theory, 2024)

An extremal problem for the neighborhood Lights Out game. - Lauren Keough; Darren B. Parker (Discuss. Math. Graph Theory, 2024)

Triangle-degree and triangle-distinct graphs. - Zhanar Berikkyzy; Beth Bjorkman; Heather C. Smith Blake; Sogol Jahanbekam; Lauren Keough; Kevin Moss; Danny Rorabaugh; Songling Shan (Discret. Math., 2024)