Some three-color Ramsey numbers, R (P4, P5, Ck) and R (P4, P6, Ck)

European Journal of Combinatorics

Volumn 30, Issue 2, 2009, Pages 396-403

  Shao, Zehui ^a   Xu, Xiaodong ^b   Shi, Xiaolong ^a   Pan, Linqiang ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b Guangxi Academy of Sciences   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 57049100930     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2008.05.008     Document Type: Article

References (12)

1. Arste J., Klamroth K., and Mengersen I. Three color Ramsey numbers for small graphs. Util. Math. 49 (1996) 85-96
2. Bollobás B. Extremal Graph Theory (1978), Academic Press
3. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1976), The Macmillan Press Ltd, London
4. Burr S.A., and Erdös P. Generalizations of a Ramsey-theoretic result of Chvátal. J. Graph Theory 7 (1983) 39-51
5. Chartrand G., and Zhang P. Introduction to Graph Theory (2006), Posts and Telecom Press
6. Clapham C.R.J., Flockhart A., and Sheehan J. Graphs without four-cycles. J. Graph Theory 13 (1989) 29-47
7. Dzido T. Multicolor Ramsey numbers for paths and cycles. Discuss. Math. Graph Theory 25 (2005) 57-65
8. Dzido T., Kubale M., and Piwakowski K. On some Ramsey and Turán-type numbers for paths and cycles. Electron. J. Combin., #R55 13 (2006). http://www.combinatorics.org/
9. Erdös P., and Gallai T. On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hungar. 10 (1959) 337-356
10. Faudree R.J., and Schelp R.H. Path Ramsey numbers in multicolorings. J. Combin. Theory, Ser. B 19 (1975) 150-160
11. Gerencsér L., and Gyárfás A. On Ramsey-type problems, Annales Universitatis Scientiarum Budapestinensis. Eötvös Sect. Math. 10 (1967) 167-170
12. B.D. McKay, nauty user's guide (version 2.2), Technique report TR-CS-90-02, Computer science Department, Australian National University, 2006. http://cs.anu.edu.au/people/bdm/