Maximally non-hamiltonian graphs of girth 7 (Q2563426)

A graph is maximally non-hamiltonian (MNH) if it is non-hamiltonian but any two non-adjacent vertices are connected by a hamiltonian path. A well-known construction of \textit{C. Thomassen} for hypo-hamiltonian graphs [Discrete Math. 9, 91-96 (1974; Zbl 0272.05114)] is shown to produce an infinite number of MNH graphs of girth 7 when iteratively applied to the Coxeter graph (which was the only previously known MNH graph of girth 7).