| 1988 |
|---|
| 7 | EE | Stefan A. Burr:
On ramsey numbers for large disjoint unions of graphs.
Discrete Mathematics 70(3): 277-293 (1988) |
| 1987 |
|---|
| 6 | EE | Stefan A. Burr:
On the Ramsey numbers r(G, nH) and r(nG, nH) when n is large.
Discrete Mathematics 65(3): 215-229 (1987) |
| 5 | EE | Stefan A. Burr:
What can we hope to accomplish in generalized Ramsey theory?
Discrete Mathematics 67(3): 215-225 (1987) |
| 1985 |
|---|
| 4 | EE | Stefan A. Burr,
Jaroslav Nesetril,
Vojtech Rödl:
On the use of senders in generalized ramsey theory for graphs.
Discrete Mathematics 54(1): 1-13 (1985) |
| 1984 |
|---|
| 3 | EE | Stefan A. Burr:
Some undecidable problems involving the edge-coloring and vertex-coloring of graphs.
Discrete Mathematics 50: 171-177 (1984) |
| 1982 |
|---|
| 2 | EE | Stefan A. Burr,
Paul Erdös,
Ralph J. Faudree,
Cecil C. Rousseau,
Richard H. Schelp:
Ramsey-minimal graphs for forests.
Discrete Mathematics 38(1): 23-32 (1982) |
| 1981 |
|---|
| 1 | EE | Stefan A. Burr,
Paul Erdös,
Ralph J. Faudree,
Cecil C. Rousseau,
Richard H. Schelp:
Ramsey-minimal graphs for star-forests.
Discrete Mathematics 33(3): 227-237 (1981) |
