For simple bipartite graphs G 1 , G 2 , G 3 , the three-colour bipartite graph Ramsey number R b (G 1 , G 2 , G 3) is defined as the least positive integer n such that any 3edge-colouring of K n,n assures a monochromatic copy of G i in the ith colour for some i, i ∈ {1, 2, 3}. In this paper, we consider the three-colour bipartite Ramsey number R b (G 1 , G 2 , P 3). Exact values are determined when G 1 = G 2 = C 4 and when (G 1 , G 2) = (a bistar, a bistar). For integers m, n ≥ 2, a recursive upper bound, R