A Canonical Ramsey Theorem. - Nancy Eaton; Vojtech Rödl (Random Struct. Algorithms, 1992)

Graphs of Small Dimensions. - Nancy Eaton; Vojtech Rödl (Comb., 1996)

Set intersection representations for almost all graphs. - Nancy Eaton; David A. Grable (J. Graph Theory, 1996)

On p-intersection representations. - Nancy Eaton; Ronald J. Gould; Vojtech Rödl (J. Graph Theory, 1996)

Intersection Representation of Complete Unbalanced Bipartite Graphs. - Nancy Eaton (J. Comb. Theory B, 1997)

Ramsey numbers for sparse graphs. - Nancy Eaton (Discret. Math., 1998)

A Near Packing of Two Graphs. - Nancy Eaton (J. Comb. Theory B, 2000)

On pebbling threshold functions for graph sequences. - Andrzej Czygrinow; Nancy Eaton; Glenn H. Hurlbert; P. Mark Kayll (Discret. Math., 2002)

Tree representations of graphs. - Nancy Eaton; Zoltán Füredi; Alexandr V. Kostochka; Jozef Skokan (Eur. J. Comb., 2007)

On the Erdos-Sos Conjecture and graphs with large minimum degree. - Nancy Eaton; Gary Tiner (Ars Comb., 2010)

On the Erdős-Sós conjecture for graphs having no path with k+4 vertices. - Nancy Eaton; Gary Tiner (Discret. Math., 2013)

K1,3-subdivision representations with tolerance 1 and 2. - Mary Ann Barbato; Nancy Eaton (Bull. ICA, 2018)

New restrictions on defective coloring with applications to steinberg-type graphs. - Addie Armstrong; Nancy Eaton (J. Comb. Optim., 2020)