On Ramsey numbers for linear forests. - Stefan A. Burr; John A. Roberts (Discret. Math., 1974)

A ramsey-theoretic result involving chromatic numbers. - Stefan A. Burr (J. Graph Theory, 1980)

On the Ramsey multiplicities of graphs - problems and recent results. - Stefan A. Burr; Vera Rosta (J. Graph Theory, 1980)

Ramsey-minimal graphs for star-forests. - Stefan A. Burr; Paul Erdös; Ralph J. Faudree; Cecil C. Rousseau; Richard H. Schelp (Discret. Math., 1981)

Multicolor Ramsey numbers involving graphs with long suspended paths. - S. A. Burr (Discret. Math., 1982)

Ramsey-minimal graphs for forests. - Stefan A. Burr; Paul Erdös; Ralph J. Faudree; Cecil C. Rousseau; Richard H. Schelp (Discret. Math., 1982)

Ramsey numbers of graphs with long tails. - S. A. Burr; Jerrold W. Grossman (Discret. Math., 1982)

Diagonal Ramsey numbers for small graphs. - S. A. Burr (J. Graph Theory, 1983)

Generalizations of a Ramsey-theoretic result of chvátal. - Stefan A. Burr; Paul Erdös (J. Graph Theory, 1983)

On Ramsey numbers involving starlike multipartite graphs. - Stefan A. Burr; Ralph J. Faudree; Cecil C. Rousseau; Richard H. Schelp (J. Graph Theory, 1983)

Some undecidable problems involving the edge-coloring and vertex-coloring of graphs. - Stefan A. Burr (Discret. Math., 1984)

On the use of senders in generalized ramsey theory for graphs. - Stefan A. Burr; Jaroslav Nesetril; Vojtech Rödl (Discret. Math., 1985)

On Graphs with Ramsey-Infinite Blocks. - Stefan A. Burr; Ralph J. Faudree; Richard H. Schelp (Eur. J. Comb., 1985)

Integer Prim-Read Solutions to a Class of Target Defense Problems. - Stefan A. Burr; James E. Falk; Alan F. Karr (Oper. Res., 1985)

An inequality involving the vertex arboricity and edge arboricity of a graph. - Stefan A. Burr (J. Graph Theory, 1986)

On the Ramsey numbers r(G, nH) and r(nG, nH) when n is large. - Stefan A. Burr (Discret. Math., 1987)

What can we hope to accomplish in generalized Ramsey theory? - Stefan A. Burr (Discret. Math., 1987)

Goodness of trees for generalized books. - Stefan A. Burr; Paul Erdös; Ralph J. Faudree; Cecil C. Rousseau; Richard H. Schelp; Ronald J. Gould; Michael S. Jacobson (Graphs Comb., 1987)

On unavoidable digraphs in orientations of graphs. - Gary S. Bloom; Stefan A. Burr (J. Graph Theory, 1987)

On ramsey numbers for large disjoint unions of graphs. - Stefan A. Burr (Discret. Math., 1988)

Maximal antiramsey graphs and the strong chromatic number. - Stefan A. Burr; Paul Erdös; Ronald L. Graham; Vera T. Sós (J. Graph Theory, 1989)

On graphsG for which all large trees areG-good. - Stefan A. Burr; Ralph J. Faudree (Graphs Comb., 1993)

Generalized Ramsey theory and decomposable properties of graphs. - Stefan A. Burr; Michael S. Jacobson; Peter Mihók; Gabriel Semanisin (Discuss. Math. Graph Theory, 1999)

Graph Theory. - Lowell W. Beineke; Stephen B. Maurer; Edward R. Scheinerman; Bennet Manvel; Arthur T. White; Paul K. Stockmeyer; Michael Doob; Stefan A. Burr; András Gyárfás (Handbook of Discrete and Combinatorial Mathematics, 1999)