Search the dblp DataBase
Stefan A. Burr: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Ramsey-minimal graphs for star-forests. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1981, v:33, n:3, pp:227-237 [Journal] - Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
Ramsey-minimal graphs for forests. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1982, v:38, n:1, pp:23-32 [Journal] - Stefan A. Burr, Jaroslav Nesetril, Vojtech Rödl
On the use of senders in generalized ramsey theory for graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1985, v:54, n:1, pp:1-13 [Journal] - Stefan A. Burr
On the Ramsey numbers r(G, nH) and r(nG, nH) when n is large. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1987, v:65, n:3, pp:215-229 [Journal] - Stefan A. Burr
What can we hope to accomplish in generalized Ramsey theory? [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1987, v:67, n:3, pp:215-225 [Journal] - Stefan A. Burr
On ramsey numbers for large disjoint unions of graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1988, v:70, n:3, pp:277-293 [Journal] - Stefan A. Burr
Some undecidable problems involving the edge-coloring and vertex-coloring of graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1984, v:50, n:, pp:171-177 [Journal]
Search in 0.001secs, Finished in 0.001secs
| 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