A note on the Ramsey number for small graphs. (English) Zbl 1487.05176
References:
| [1] | Bataineh, M. S.; Vetrík, T.; Jaradat, M. M. M.; Rabaiah, A. M. M., The Ramsey number for two graphs of order 5, J. Discrete Math. Sci. Cryptogr, 21, 1523-1528 (2018) · Zbl 1481.05107 · doi:10.1080/09720529.2018.1479179 |
| [2] | Bolze, R.; Harborth, H., The Ramsey number r(K_4 - x, K_5), Theory and Application of Graphs, 109-116 (1981), Kalamazoo, New York · Zbl 0463.05051 |
| [3] | Burr, S. A.; Erdös, P., Generalizations of a Ramsey-theoretic result of Chvátal, J. Graph Theory, 7, 39-51 (1981) · Zbl 0513.05040 · doi:10.1002/jgt.3190070106 |
| [4] | Chvátal, V.; Harary, F., Generalized Ramsey theory for graphs, II. Small diagonal numbers, Proc. Amer. Math. Soc, 32, 389-394 (1972) · Zbl 0229.05116 · doi:10.2307/2037824 |
| [5] | Clancy, M., Some small Ramsey numbers, J. Graph Theory, 1, 89-91 (1977) · Zbl 0351.05121 · doi:10.1002/jgt.3190010117 |
| [6] | Hendry, G. R. T., Small Ramsey numbers II. Critical colorings for r(C_5 + e, K_5), Quaest. Math., 249-258 (1994) · Zbl 0804.05035 · doi:10.1080/16073606.1994.9631763 |
| [7] | Jaradat, M. M. M.; Bataineh, M. S.; Vetrík, T.; Rabaiah, A. M. M., A note on the Ramsey numbers for theta graphs versus the wheel of order 5, AKCE Int. J. Graphs Comb, 15, 187-189 (2018) · Zbl 1403.05095 · doi:10.1016/j.akcej.2017.08.002 |
| [8] | Surahmat, E.; Baskoro, T.; Broersma, H. J., The Ramsey numbers of large cycles versus small wheels, Integers, 4, 1-9 (2004) · Zbl 1061.05063 |
| [9] | Surahmat, E.; Baskoro, T.; Tomescu, I., The Ramsey numbers of large cycles versus wheels, Discrete Math, 306, 3334-3337 (2006) · Zbl 1110.05070 · doi:10.1016/j.disc.2006.06.006 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
