J. Sheehan

According to our database, J. Sheehan authored at least 13 papers between 1978 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2002

Maintenance issues in the Web site development process.

Mark John Taylor, J. McWilliam, J. Sheehan, A. Mulhaney

J. Softw. Maintenance Res. Pract., 2002

1998

The maximum number of edges in a graph with fixed edge-degree.

Ralph J. Faudree, J. Sheehan

Discret. Math., 1998

1994

Graphical decompositions.

J. Sheehan

Discret. Math., 1994

1993

All trees are 1-embeddable and all except stars are 2-embeddable.

C. R. J. Clapham, J. Sheehan

Discret. Math., 1993

1989

Graphs without four-cycles.

C. R. J. Clapham, A. Flockhart, J. Sheehan

J. Graph Theory, 1989

The ramsey number of k₅ - e.

C. R. J. Clapham, Geoffrey Exoo, Heiko Harborth, Ingrid Mengersen, J. Sheehan

J. Graph Theory, 1989

1984

Regular graphs and edge chromatic number.

Ralph J. Faudree, J. Sheehan

Discret. Math., 1984

1983

Size Ramsey numbers for small-order graphs.

Ralph J. Faudree, J. Sheehan

J. Graph Theory, 1983

Size Ramsey numbers involving stars.

Ralph J. Faudree, J. Sheehan

Discret. Math., 1983

1981

On the number of complete subgraphs contained in certain graphs.

R. J. Evans, J. R. Pulham, J. Sheehan

J. Comb. Theory B, 1981

1980

Ramsey numbers for matchings.

Ralph J. Faudree, Richard H. Schelp, J. Sheehan

Discret. Math., 1980

1979

Three-regular subgraphs of four-regular graphs.

Vasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen

J. Graph Theory, 1979

1978

On ramsey numbers for books.

Cecil C. Rousseau, J. Sheehan

J. Graph Theory, 1978