hypohamiltonian graph
Sign in to savegraph 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 facts
- Named after
- William Rowan Hamilton
- Image
- Lindgren hypohamiltonian 15.svg
Show 2 more facts
- maintained by WikiProject
- WikiProject Mathematics
- studied by
- graph theory
via Wikidata · CC0