A graph \(G\) is said to be \(locally\) \(hamiltonian\) if the subgraph induced by the neighbourhood of every vertex is hamiltonian. Alabdullatif conjectured that every connected locally hamiltonian graph contains a spanning plane triangulation. We disprove the conjecture. At the end, we raise a problem about the nonexistence of spanning planar triangulation in a class of graphs.