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
In the Vinony graph
Vinony's link graph records 17 inbound references to hypohamiltonian graph, and connects out to Hamiltonian path, mathematics and International Standard Book Number.
Vinony files it under Graph families and Hamiltonian paths and cycles.
Vinony links it to 7 Wikipedia language editions.
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
Connections
Hamiltonian path
Entity
mathematics
Entity
International Standard Book Number
Entity
digital object identifier
Entity
Donald Knuth
Entity
graph theory
Entity
parity
Entity
graph
Entity
JSTOR
Organization
bibcode
Entity
arXiv
Entity
network topology
Entity
modular arithmetic
Entity
parallel computing
Entity
conjecture
Entity
travelling salesperson problem
Entity
On-Line Encyclopedia of Integer Sequences
Entity
exponential growth
Entity
computational complexity theory
Entity
MathWorld
Entity