1. Achlioptas, D.: The complexity of $$G$$-free colorability. Discrete Math. 165–166, 21–30 (1997)
2. Antunes Filho, I.T.F.: Characterizing Boolean Satisfiability Variants. Ph.D. thesis, Massachusetts Institute of Technology (2019)
3. Berman, P., Karpinski, M., Scott, A.: Approximation Hardness of Short Symmetric Instances of MAX-3SAT. ECCC (2003)
4. Bikov, A.: Computation and Bounding of Folkman Numbers. Ph.D. thesis, Sofia University "St. Kliment Ohridski" (2018)
5. Burr, S.A.: On the computational complexity of Ramsey-type problems. Math. Ramsey Theory, Algorithms Comb. 5, 46–52 (1990)