1. Bean, D.R.: Effective coloration. J. Symb. Log. 41(2), 469–480 (1976)
2. Bodlaender, H.: On the complexity of some coloring games. Int. J. Found. Comput. Sci. 2.02, 133–147 (1991)
3. Böhm, M., Veselý, P.: Online chromatic number is PSPACE-complete. In: Proceedings of 27th international workshop on combinatorial algorithms (IWOCA 2016). LNCS 9843, pp. 16–28 (2016)
4. Csernenszky, A., Martin, R.R., Pluhár, A.: On the complexity of Chooser-Picker positional games. arXiv: 1605.05430 (2016)
5. Dvořák, P., Valla, T.: On the computational complexity and strategies of online Ramsey theory. In: Proceedings of 8th European conference on combinatorics, graph theory and applications (EuroComb 2015), vol. 49, pp. 729–736 (2015)