1. Andrásfai, B.: Remarks on a paper of Gerencsér and Gyárfás, Ann. Univ. Sci. Eötvös, Budapest 13, 103–107 (1970)
2. Burr, S.A.: Either a graph or its complement has a spanning broom (manuscript)
3. Bialostocki, A., Dierker, P., Voxman, W.: Either a graph or its complement is connected: a continuing saga, manuscript (2001)
4. Bollobás, B., Gyárfás, A.: Highly connected monochromatic subgraphs, Discrete Math. 308, 1722–1725 (2008)
5. Erdős, P., Faudree, R., Gyárfás, A., Schelp, R.H.: Domination in colored complete graphs, Journal of Graph Theory 13, 713–718 (1989)