Author:
Erdős P.,Faudree R. J.,Rousseau C. C.,Schelp R. H.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference7 articles.
1. J. A. Bondy andP. Erdős, Ramsey numbers for cycles in graphs.J. Combinatorial Theory (B) 14 (1973), 46–54.
2. S. A. Burr, Ramsey numbers involving graphs with long suspended paths.J. London Math. Soc. 24 (1981), 405–413.
3. S. A. Burr, P. Erdős, R. J. Faudree, C. C. Rousseau andR. H. Schelp, Ramsey numbers for the pair sparse graph-path or cycle.Trans. Amer. Math. Soc. 269 (1982), 501–512.
4. V. Chvátal, Tree-complete graph Ramsey numbers,J. Graph Theory 1 (1977), 93.
5. R. J. Faudree, C. C. Rousseau andR. H. Schelp, Generalizations of a Ramsey result of Chvátal.The Theory and Applications of Graphs (G. Chartrand, ed.) Wiley, New York (1981), 351–361.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献