Independence in graphs with maximum degree four. - Kathryn Fraughnaugh Jones (J. Comb. Theory B, 1984)

Niche graphs. - Charles Cable; Kathryn Fraughnaugh Jones; J. Richard Lundgren; Suzanne M. Seager (Discret. Appl. Math., 1989)

Size and independence in triangle-free graphs with maximum degree three. - Kathryn Fraughnaugh Jones (J. Graph Theory, 1990)

A Two-Dimensional Genetic Algorithm for the Ising Problem. - Charles A. Anderson; Kathryn Fraughnaugh Jones; Jennifer Ryan (Complex Syst., 1991)

(i, j) competition graphs. - Kim A. S. Hefner; Kathryn Fraughnaugh Jones; Suh-Ryung Kim; J. Richard Lundgren; Fred S. Roberts (Discret. Appl. Math., 1991)

What is the difference between the domination and independent domination numbers of a cubic graph? - Curtiss Barefoot; Frank Harary; Kathryn Fraughnaugh Jones (Graphs Comb., 1991)

Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices. - David A. Gregory; Norman J. Pullman; Kathryn Fraughnaugh Jones; J. Richard Lundgren (J. Comb. Theory B, 1991)