Let C-1 and C-2 be two sets of cycles. We determine all generalised Ramsey numbers R(C-1, C-2) such that C-1 or C-2 contains a cycle of length at most 6. This generalises previous results of Erdos, Faudree, Rosta, Rousseau, and Schelp. Furthermore, we give a conjecture for the general case. We also provide a complete classification of most (C-1, C-2)-critical graphs such that C-1 or C-2 contains a cycle of length at most 5. For length 4, this is an easy extension of a recent result of Wu, Sun, and Radziszowski, in which vertical bar C-1 vertical bar = vertical bar C-2 vertical bar = 1. For lengths 3 and 5, our results are new also in this special case. (C) 2017 Elsevier B.V. All rights reserved.