1. J. Nesetril and V. Rodl, Comment. Math. Univ. Carolinae 17, 85–95 (1976).
2. Non-bipartite pairs of3-connected graphs are highly Ramsey-infinite
3. S.A. Burr, P. Erdos, R.J. Faudree, C.C. Rosseu, and R.H. Schelp, Ramsey-minimal graphs for forests, Studia Scient. Math. Hungar. 15, 265–273 (1982).
4. S.A. Burr, P. Erdos, and L. Lovasz, Ars Combinatoria 1, 167–190 (1976).
5. L. Yulianti, H. Assiyatun, S. Uttunggadewa, and E.T. Baskoro, Far East Journal of Mathematical Sciences 40, 23–36 (2010).