On some three color Ramsey numbers for paths and cycles

Discrete Mathematics

Volumn 309, Issue 15, 2009, Pages 4955-4958

  Dzido, Tomasz ^a   Fidytek, Robert ^a  

^a UNIVERSITY OF GDA SK   (Poland)

Author keywords

Edge coloring; Ramsey numbers

Indexed keywords

COMPLETE GRAPHS; EDGE COLORING; INTEGER-N; RAMSEY NUMBERS;

COLOR; COLORING; MACHINE TOOLS;

GRAPH THEORY;

EID: 67249083529     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2008.04.053     Document Type: Article

References (8)

1. Arste J., Klamroth K., and Mengersen I. Three color Ramsey numbers for small graphs. Util. Math. 49 (1996) 85-96
2. Brandt S. A sufficient condition for all short cycles. Discrete Appl. Math. 79 (1997) 63-66
3. Caccetta L., and Vijayan K. Maximal cycles in graphs. Discrete Math. 98 (1991) 1-7
4. Dzido T. Multicolor Ramsey numbers for paths and cycles. Discuss. Math. Graph Theory 25 (2005) 57-65
5. Dzido T., Kubale M., and Piwakowski K. On some Ramsey and Turán-type numbers for paths and cycles. Electron. J. Combin 13 (2006) #R55
6. Faudree R.J., and Schelp R.H. Path Ramsey numbers in multicolorings. J. Combin. Theory Ser. B 19 (1975) 150-160
7. Gerencsér L., and Gyárfás A.M. On Ramsey-type problems. Anales Universitatis Scientiarum Budapestinensis, Eötvös Sect. Math. 10 (1967) 167-170
8. Woodall D.R. Maximal circuits of graphs I. Acta Math. Acad. Sci. Hungar. 28 (1976) 77-80