Authors: Guofei Zhou ¹; Yaojun Chen ¹; Zhengke Miao ²; Shariefuddin Pirzada ³

• 1 Department of Mathematics [Nanjing]
• 2 Department of Mathematics [Xuzhou]
• 3 Department of Mathematics [Srinagar]

For two given graphs G and H , the planar Ramsey number P R ( 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 for a triangle versus wheels.