J. Sheehan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 13 from 13

2002

Maintenance issues in the Web site development processMark J. Taylor, J. McWilliam, J. Sheehan, A. Mulhaney. SMR, 14(2):109-122, 2002.

1998

The maximum number of edges in a graph with fixed edge-degreeRalph J. Faudree, J. Sheehan. DM, 183(1-3):81-101, 1998. [doi]

1994

Graphical decompositionsJ. Sheehan. DM, 125(1-3):347-355, 1994. [doi]

1993

All trees are 1-embeddable and all except stars are 2-embeddableC. R. J. Clapham, J. Sheehan. DM, 120(1-3):253-259, 1993. [doi]

1989

Graphs without four-cyclesC. R. J. Clapham, A. Flockhart, J. Sheehan. jgt, 13(1):29-47, 1989. [doi]

5 - eC. R. J. Clapham, Geoffrey Exoo, Heiko Harborth, Ingrid Mengersen, J. Sheehan. jgt, 13(1):7-15, 1989. [doi]

1984

Regular graphs and edge chromatic numberRalph J. Faudree, J. Sheehan. DM, 48(2-3):197-204, 1984. [doi]

1983

Size Ramsey numbers involving starsRalph J. Faudree, J. Sheehan. DM, 46(2):151-157, 1983. [doi]

Size Ramsey numbers for small-order graphsRalph J. Faudree, J. Sheehan. jgt, 7(1):53-55, 1983. [doi]

1981

On the number of complete subgraphs contained in certain graphsR. J. Evans, J. R. Pulham, J. Sheehan. JCT, 30(3):364-371, 1981. [doi]

1980

Ramsey numbers for matchingsRalph J. Faudree, Richard H. Schelp, J. Sheehan. DM, 32(2):105-123, 1980. [doi]

1979

Three-regular subgraphs of four-regular graphsVasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen. jgt, 3(4):371-386, 1979. [doi]

1978

On ramsey numbers for booksCecil C. Rousseau, J. Sheehan. jgt, 2(1):77-87, 1978. [doi]

Sign in or sign up to see more results.

runs on WebDSL