Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference24 articles.
1. Bielak, H., Gorgol, I.: The planar Ramsey number for $$C_4$$ and $$K_5$$ is 13. Discrete Math. 236, 43–51 (2001)
2. Brinkmann, G., McKay, B.D.: Construction of planar triangulations with minimum degree 5. Discrete Math. 301, 147–163 (2005)
3. Burr, S., Erdős, P., Faudree, R.J., Rousseau, C.C., Schelp, R.H.: Some complete bipartite graph-tree Ramsey numbers. Ann. Discrete Math. 41, 79–89 (1988)
4. Chartrand, G., Kaugars, A., Lick, D.R.: Critically $$n$$-connected graphs. Proc. Am. Math. Soc. 32, 63–68 (1972)
5. Chen, Y.J., Cheng, T.C.E., Zhang, Y.Q., Zhou, G.F.: The planar Ramsey number $$PR(C_4, K_8)$$. Discrete Appl. Math. 171, 28–34 (2014)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献