@inproceedings{e882c6bc78d0440988791ef74b03cba7,
title = "An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels",
abstract = "For given graphs G and H, the Ramsey numberR(G,H) is the smallest positive integer n such that every graph F of n vertices satisfies the following property: either F contains G or the complement of F contains H. In this paper, we show that the Ramsey number R(C4,Wm)≤m+⌈m3⌉+1 for m ≥ 6.",
keywords = "METIS-226159",
author = "Surahmat and Baskoro, \{Edy Tri\} and Saladin Uttunggadewa and Hajo Broersma",
year = "2005",
doi = "10.1007/978-3-540-30540-8\_20",
language = "English",
isbn = "978-3-540-24401-1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "181--184",
editor = "Jin Akiyama and Baskoro, \{Edy Tri\} and Mikio Kano",
booktitle = "Combinatorial Geometry and Graph Theory",
address = "Germany",
note = "Indonesia-Japan Joint Conference on Combinatorial Geometry and Graph Theory, IJCCGGT 2003, IJCCGGT ; Conference date: 13-09-2003 Through 16-09-2003",
}