Fullerene patches I. - Jack E. Graver; Christina M. Graves (Ars Math. Contemp., 2010)

Inflection points of coherent reliability polynomials. - Christina Graves 001 (Australas. J Comb., 2011)

Side lengths of pseudoconvex fullerene patches. - Christina M. Graves; Jennifer McLoud-Mann (Ars Math. Contemp., 2012)

Non-Recursively Constructible Recursive Families of Graphs. - Colleen Bouey; Christina Graves 001; Aaron Ostrander; Gregory Palma (Electron. J. Comb., 2012)

Fullerene patches II. - Jack E. Graver; Christina Graves 001; Stephen J. Graves (Ars Math. Contemp., 2014)

Reliability polynomials having arbitrarily many inflection points. - Christina Graves 001; David Milan (Networks, 2014)

Extending patches to fullerenes. - Christina Graves 001; Jennifer McLoud-Mann; Kristen Stagg Rovira (Ars Math. Contemp., 2015)

Vertex-minimal graphs with dihedral symmetry I. - Christina Graves 001; Stephen J. Graves; Lindsey-Kay Lauderdale (Discret. Math., 2017)

Smallest graphs with given generalized quaternion automorphism group. - Christina Graves 001; Stephen J. Graves; Lindsey-Kay Lauderdale (J. Graph Theory, 2018)

On uniformly most reliable two-terminal graphs. - Hayley Bertrand; Owen Goff; Christina Graves 001; Maggie Sun (Networks, 2018)

Classes of uniformly most reliable graphs for all-terminal reliability. - Kassie Archer; Christina Graves 001; David Milan (Discret. Appl. Math., 2019)

Vertex-minimal graphs with dihedral symmetry II. - Christina Graves 001; Lindsey-Kay Lauderdale (Discret. Math., 2019)

Counting acyclic and strong digraphs by descents. - Kassie Archer; Ira M. Gessel; Christina Graves 001; Xuming Liang (Discret. Math., 2020)

Most reliable two-terminal graphs with node failures. - Isaac Brown; Christina Graves 001; Brendan Miller; Tyler Russell (Networks, 2020)

Network reliability: Heading out on the highway. - Jason I. Brown; Charles J. Colbourn; Danielle Cox; Christina Graves 001; Lucas Mol (Networks, 2021)

Pattern-restricted permutations composed of 3-cycles. - Kassie Archer; Christina Graves 001 (Discret. Math., 2022)

A new statistic on Dyck paths for counting 3-dimensional Catalan words. - Kassie Archer; Christina Graves 001 (Discret. Math., 2023)

More reliable graphs are not always stronger. - Christina Graves 001 (Networks, 2023)

Fixing Numbers of Graphs with Symmetric and Generalized Quaternion Symmetry Groups. - Christina Graves 001; Lindsey-Kay Lauderdale (Graphs Comb., 2024)