[1] |
Generalized Ramsey theory for graphs–A survey. In Graphs and Combinatorics. Springer, Berlin (1974) 52–75. |
[2] |
Burr, Utilitas Math. 9 pp 247– (1976) |
[3] |
Burr, Trans. Amer. Math. Soc. 209 pp 87– (1975) |
[4] |
Burr, Discrete Math. 41 pp 223– (1982) |
[5] |
Burr, Discrete Math. 8 pp 245– (1974) |
[6] |
Chartrand, Bull. Amer. Math. Soc. 77 pp 995– (1971) |
[7] |
Chvátal, Proc. Amer. Math. Soc. 32 pp 389– (1972) |
[8] |
Chvátal, Pacif. J. Math. 41 pp 335– (1972) · Zbl 0227.05115 · doi:10.2140/pjm.1972.41.335 |
[9] |
Clancy, J. Graph Theory 1 pp 89– (1977) |
[10] |
Cockayne, J. Australian Math. Soc. A 19 pp 252– (1975) |
[11] |
, and , All triangle-graph Ramsey numbers for connected graphs of order six. J. Graph Theory (1980) 293–300. · Zbl 0446.05035 |
[12] |
Faudree, Discrete Math. 8 pp 313– (1974) |
[13] |
Gardner, Scientific American 237 pp 18– (1977) · doi:10.1038/scientificamerican1077-18 |
[14] |
Gerencsér, Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 10 pp 167– (1967) |
[15] |
Goodman, Amer. Math. Monthly 66 pp 778– (1959) |
[16] |
Greenwood, Canad. J. Math. 7 pp 1– (1955) · Zbl 0064.17901 · doi:10.4153/CJM-1955-001-4 |
[17] |
Grossman, Utilitas Math. 16 pp 271– (1979) |
[18] |
Grossman, Ars Combinatoria. 8 pp 59– (1979) |
[19] |
Grossman, Discrete Math. 28 pp 247– (1979) |
[20] |
Graph Theory. Addison Wesley, Reading, MA (1969). |
[21] |
Rosta, J. Combinatorial Theory Ser. B 15 pp 94– (1973) |
[22] |
Rosta, J. Combinatorial Theory Ser. B 15 pp 105– (1973) |
[23] |
personal communication. |
[24] |
Rousseau, J. Graph Theory 2 pp 77– (1978) |