On the triangle vertex Folkman numbers

V. Chvátal, The minimality of the Mycielski graph, Lecture Notes in Mathematics, Vol. 406, Springer, Berlin, 1974, pp. 243–246. Folkman, 1970, Graphs with monochromatic complete subgraphs in every edge coloring, SIAM J. Appl. Math., 18, 19, 10.1137/0118004 Gallai, 1963, Kritische graphen II, Publ. Math. Inst. Hungar. Acad. Sci., 8, 373 T. Gallai, Critical graphs, in: Theory of Graphs and its Applications, Proceedings of the Symposium held in Smolenice in June 1963, Czechoslovak Akad. Sciences, Prague, 1964, pp. 43–45. Łuczak, 1996, A note on restricted vertex Ramsey numbers, Period. Math. Hungar., 33, 101, 10.1007/BF02093507 Łuczak, 2001, On minimal vertex Folkman graphs, Discrete Math., 236, 245, 10.1016/S0012-365X(00)00445-3 Mycielski, 1955, Sur le coloriage des graphes, Colloq. Math., 3, 161, 10.4064/cm-3-2-161-162 N. Nenov, Ramsey graphs and some constants related to them, Ph. D. Thesis, University of Sofia, Sofia, 1980. Nenov, 1981, An example of a 15-vertex (3,3)-Ramsey graph with clique number 4, C. R. Acad. Bulgare Sci., 34, 1487 Nenov, 1983, On the Zykov numbers and some its applications to Ramsey theory, Serdica Bulgaricae Math. Publicationes, 9, 161 Nenov, 1984, The chromatic number of any 10-vertex graph without 4-cliques is at most 4, C. R. Acad. Bulgare Sci., 37, 301 Nenov, 1998, On the small graphs with chromatic number 5 without 4-cliques, Discrete Math., 188, 297, 10.1016/S0012-365X(98)00083-1 Nenov, 2000, On a class of vertex Folkman graphs, Annuaire Univ. Sofia, Fac. Math. Inform., 94, 15 Nenov, 2001, Computation of the vertex Folkman numbers F(2,2,2,3;5) and F(2,3,3;5), Annuaire Univ. Sofia Fac. Math. Inform., 95, 17 Piwakowski, 1999, Computation of the Folkman number Fe(3,3;5), J. Graph Theory, 32, 41, 10.1002/(SICI)1097-0118(199909)32:1<41::AID-JGT4>3.0.CO;2-P