default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan A. Burr
Person information
- affiliation: C.U.N.Y. New York, City College, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1999
[j23]Stefan A. Burr, Michael S. Jacobson, Peter Mihók, Gabriel Semanisin
:
Generalized Ramsey theory and decomposable properties of graphs. Discuss. Math. Graph Theory 19(2): 199-217 (1999)- [r1]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:
Graph Theory. Handbook of Discrete and Combinatorial Mathematics 1999 - 1993
- [j22]Stefan A. Burr, Ralph J. Faudree:
On graphsG for which all large trees areG-good. Graphs Comb. 9(2-4): 305-313 (1993)
1980 – 1989
- 1989
- [j21]Stefan A. Burr, Paul Erdös, Ronald L. Graham, Vera T. Sós:
Maximal antiramsey graphs and the strong chromatic number. J. Graph Theory 13(3): 263-282 (1989) - 1988
- [j20]Stefan A. Burr:
On ramsey numbers for large disjoint unions of graphs. Discret. Math. 70(3): 277-293 (1988) - 1987
- [j19]Stefan A. Burr:
On the Ramsey numbers r(G, nH) and r(nG, nH) when n is large. Discret. Math. 65(3): 215-229 (1987) - [j18]Stefan A. Burr:
What can we hope to accomplish in generalized Ramsey theory? Discret. Math. 67(3): 215-225 (1987) - [j17]Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Ronald J. Gould, Michael S. Jacobson:
Goodness of trees for generalized books. Graphs Comb. 3(1): 1-6 (1987) - [j16]Gary S. Bloom, Stefan A. Burr:
On unavoidable digraphs in orientations of graphs. J. Graph Theory 11(4): 453-462 (1987) - 1986
- [j15]Stefan A. Burr:
An inequality involving the vertex arboricity and edge arboricity of a graph. J. Graph Theory 10(3): 403-404 (1986) - 1985
- [j14]Stefan A. Burr, Jaroslav Nesetril, Vojtech Rödl:
On the use of senders in generalized ramsey theory for graphs. Discret. Math. 54(1): 1-13 (1985) - [j13]Stefan A. Burr, Ralph J. Faudree, Richard H. Schelp:
On Graphs with Ramsey-Infinite Blocks. Eur. J. Comb. 6(2): 129-132 (1985) - [j12]Stefan A. Burr, James E. Falk, Alan F. Karr:
Integer Prim-Read Solutions to a Class of Target Defense Problems. Oper. Res. 33(4): 726-745 (1985) - 1984
- [j11]Stefan A. Burr:
Some undecidable problems involving the edge-coloring and vertex-coloring of graphs. Discret. Math. 50: 171-177 (1984) - 1983
- [j10]Stefan A. Burr, Paul Erdös:
Generalizations of a Ramsey-theoretic result of chvátal. J. Graph Theory 7(1): 39-51 (1983) - [j9]S. A. Burr:
Diagonal Ramsey numbers for small graphs. J. Graph Theory 7(1): 57-69 (1983) - [j8]Stefan A. Burr, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
On Ramsey numbers involving starlike multipartite graphs. J. Graph Theory 7(4): 395-409 (1983) - 1982
- [j7]Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Ramsey-minimal graphs for forests. Discret. Math. 38(1): 23-32 (1982) - [j6]S. A. Burr:
Multicolor Ramsey numbers involving graphs with long suspended paths. Discret. Math. 40(1): 11-20 (1982) - [j5]S. A. Burr, Jerrold W. Grossman:
Ramsey numbers of graphs with long tails. Discret. Math. 41(3): 223-227 (1982) - 1981
- [j4]Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Ramsey-minimal graphs for star-forests. Discret. Math. 33(3): 227-237 (1981) - 1980
- [j3]Stefan A. Burr:
A ramsey-theoretic result involving chromatic numbers. J. Graph Theory 4(2): 241-242 (1980) - [j2]Stefan A. Burr, Vera Rosta:
On the Ramsey multiplicities of graphs - problems and recent results. J. Graph Theory 4(4): 347-361 (1980)
1970 – 1979
- 1974
- [j1]Stefan A. Burr, John A. Roberts:
On Ramsey numbers for linear forests. Discret. Math. 8(3): 245-250 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
