Search the dblp DataBase
J. Sheehan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- R. J. Evans, J. R. Pulham, J. Sheehan
On the number of complete subgraphs contained in certain graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1981, v:30, n:3, pp:364-371 [Journal] - Mark J. Taylor, J. McWilliam, J. Sheehan, A. Mulhaney
Maintenance issues in the Web site development process. [Citation Graph (0, 0)][DBLP]
Journal of Software Maintenance, 2002, v:14, n:2, pp:109-122 [Journal] - Ralph J. Faudree, Richard H. Schelp, J. Sheehan
Ramsey numbers for matchings. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1980, v:32, n:2, pp:105-123 [Journal] - Ralph J. Faudree, J. Sheehan
Size Ramsey numbers involving stars. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1983, v:46, n:2, pp:151-157 [Journal] - Ralph J. Faudree, J. Sheehan
Regular graphs and edge chromatic number. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1984, v:48, n:2-3, pp:197-204 [Journal] - Ralph J. Faudree, J. Sheehan
The maximum number of edges in a graph with fixed edge-degree. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1998, v:183, n:1-3, pp:81-101 [Journal] - C. R. J. Clapham, J. Sheehan
All trees are 1-embeddable and all except stars are 2-embeddable. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1993, v:120, n:1-3, pp:253-259 [Journal] - J. Sheehan
Graphical decompositions. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1994, v:125, n:1-3, pp:347-355 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002