On ramsey numbers for books. - Cecil C. Rousseau; J. Sheehan (J. Graph Theory, 1978)

Three-regular subgraphs of four-regular graphs. - Vasek Chvátal; Herbert Fleischner; J. Sheehan; Carsten Thomassen (J. Graph Theory, 1979)

Ramsey numbers for matchings. - Ralph J. Faudree; Richard H. Schelp; J. Sheehan (Discret. Math., 1980)

On the number of complete subgraphs contained in certain graphs. - R. J. Evans; J. R. Pulham; J. Sheehan (J. Comb. Theory B, 1981)

Size Ramsey numbers involving stars. - Ralph J. Faudree; J. Sheehan (Discret. Math., 1983)

Size Ramsey numbers for small-order graphs. - Ralph J. Faudree; J. Sheehan (J. Graph Theory, 1983)

Regular graphs and edge chromatic number. - Ralph J. Faudree; J. Sheehan (Discret. Math., 1984)

The ramsey number of k5 - e. - C. R. J. Clapham; Geoffrey Exoo; Heiko Harborth; Ingrid Mengersen; J. Sheehan (J. Graph Theory, 1989)

Graphs without four-cycles. - C. R. J. Clapham; A. Flockhart; J. Sheehan (J. Graph Theory, 1989)

All trees are 1-embeddable and all except stars are 2-embeddable. - C. R. J. Clapham; J. Sheehan (Discret. Math., 1993)

Graphical decompositions. - J. Sheehan (Discret. Math., 1994)

The maximum number of edges in a graph with fixed edge-degree. - Ralph J. Faudree; J. Sheehan (Discret. Math., 1998)

Maintenance issues in the Web site development process. - Mark John Taylor; J. McWilliam; J. Sheehan; A. Mulhaney (J. Softw. Maintenance Res. Pract., 2002)