# hypohamiltonian graph

> graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian

**Wikidata**: [Q3115577](https://www.wikidata.org/wiki/Q3115577)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Hypohamiltonian_graph)  
**Source**: https://4ort.xyz/entity/hypohamiltonian-graph