Infinitely many planar cubic hypohamiltonian graphs of girth 5

A graph G is hypohamiltonian if G is non‐hamiltonian and for every vertex v in G, the graph is hamiltonian. McKay asked in [J. Graph Theory 85 (2017) 7–11] whether infinitely many planar cubic hypohamiltonian graphs of girth 5 exist. We settle this question affirmatively.