Author:
Chen Yaojun,Miao Zhengke,Zhou Guofei
Funder
National Natural Science Foundation of China
NSFC
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Bielak, H.: A note on the Ramsey number and the planar Ramsey number for $$C_4$$ C 4 and complete graphs. Discuss. Math. Graph Theory 19, 135–142 (1999)
2. Brinkmann, G., McKay, B.D.: Construction of planar triangulations with minimum degree 5. Discret. Math. 301, 147–163 (2005)
3. Conlon, D.: A new upper bound for diagonal Ramsey numbers. Ann. Math. 170, 941–960 (2009)
4. Dudek, A., Rucinski, A.: Planar Ramsey numbers for small graphs. In: 36th Southeastern international conference on combinatorics, graph theory, and computing, congressus numerantium, 176, 201-220 (2005)
5. Gorgol, I., Rucinski, A.: Planar Ramsey numbers for cycles. Discret. Math. 308, 4389–4395 (2008)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Complete Graph-Tree Planar Ramsey Numbers;Graphs and Combinatorics;2019-09-03
2. QUADRILATERAL-TREE PLANAR RAMSEY NUMBERS;Bulletin of the Australian Mathematical Society;2018-01-30