Highly non-concurrent longest cycles in lattice graphs

There exist planar graphs in which any two vertices are missed by some longest cycle. Although this requirement is very strong, we prove here that such graphs can also be found as subgraphs of the square and hexagonal lattices. Considering (finite) such lattices on the torus and on the Mِbius strip enables us to reduce the order of our examples.