Planar Ramsey numbers for cycles

For two given graphs G and H   the planar Ramsey number PR(G,H)PR(G,H) is the smallest integer n such that every planar graph F on n vertices either contains a copy of G or its complement contains a copy H. By studying the existence of subhamiltonian cycles in complements of sparse graphs, we determine all planar Ramsey numbers for pairs of cycles.