Discrete Mathematics & Theoretical Computer Science, Vol 14, No 2 (2012)

Font Size:  Small  Medium  Large

A Note on Planar Ramsey Numbers for a Triangle Versus Wheels

Guofei Zhou, Yaojun Chen, Zhengke Miao, Shariefuddin Pirzada


For two given graphs G and H the planar Ramsey number PR(G,H) is the smallest integer n such that every planar graph F on n vertices either contains a copy of G, or its complement contains a copy of H. In this paper, we determine all planar Ramsey numbers of triangle versus wheels.

Full Text: PDF PostScript