On the complexity of HH-colouring planar graphs

We show that if HH is an odd-cycle, or any non-bipartite graph of girth 5 and maximum degree at most 3, then planar HH-COL is NPNP-complete.