The Characterization of planar, 4-connected, K_{2, 5}-minor-free graphs. - Emily Abernethy Marshall; Liana Yepremyan; Zach Gaslowitz (CoRR, 2015)

Circumference and Pathwidth of Highly Connected Graphs. - Emily Abernethy Marshall; David R. Wood (J. Graph Theory, 2015)

Criticality of Counterexamples to Toroidal Edge-Hamiltonicity. - Mark N. Ellingham; Emily Abernethy Marshall (Graphs Comb., 2016)

A Characterization of K2, 4-Minor-Free Graphs. - Mark N. Ellingham; Emily Abernethy Marshall; Kenta Ozeki; Shoichi Tsuchiya (SIAM J. Discret. Math., 2016)

On Almost-Planar Graphs. - Guoli Ding; Joshua Fallon; Emily Marshall 001 (Electron. J. Comb., 2018)

Minimal k-Connected Non-Hamiltonian Graphs. - Guoli Ding; Emily Marshall 001 (Graphs Comb., 2018)

Excluding a large theta graph. - Guoli Ding; Emily Marshall 001 (J. Comb. Theory B, 2018)

Hamiltonicity of planar graphs with a forbidden minor. - Mark N. Ellingham; Emily Abernethy Marshall; Kenta Ozeki; Shoichi Tsuchiya (J. Graph Theory, 2019)

Sharp Minimum Degree Conditions for the Existence of Disjoint Theta Graphs. - Emily Marshall 001; Michael Santana (Electron. J. Comb., 2021)

Launching a Data Analytics Major: How Collaboration and Agility Built a Successful Program. - Richard J. Forrester; Emily Marshall 001; Jeffrey Forrester; David Richeson; Jennifer Schaefer (Am. Math. Mon., 2025)