The planar Ramsey number PR(K4-e,K5)PR(K4-e,K5)

The planar Ramsey number PR(H1,H2)PR(H1,H2) is the smallest integer n such that any planar graph on n   vertices contains a copy of H1H1 or its complement contains a copy of H2H2. It is known that the Ramsey number R(K4-e,K5)=16R(K4-e,K5)=16. The planar Ramsey numbers PR(K4-e,K3)=7PR(K4-e,K3)=7 and PR(K4-e,K4)=10PR(K4-e,K4)=10 are known. In this paper we show that PR(K4-e,K5)=14PR(K4-e,K5)=14.