All Complete Graph-Wheel Planar Ramsey Numbers

作者：Zhang Yanbo; Zhou Guofei; Chen Yaojun^*

来源：Graphs and Combinatorics, 2015, 31(6): 2459-2465.

DOI：10.1007/s00373-014-1509-y

• Planar Ramsey number
• Complete graph
• Wheel

For two given graphs and , the planar Ramsey number is the smallest integer such that for any planar graph of order , either contains or the complement of contains . Let denote a complete graph of order and a wheel of order . In this paper, we determine all planar Ramsey numbers PR(K-m, W-n).

• 出版日期2015-11
• 单位南京大学