In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G itself does not have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian. == History == Hypohamiltonian graphs were first studied by Sousselier (1963).
In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G itself does not have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian. == History == Hypohamiltonian graphs were first studied by Sousselier (1963).
Source: Wikipedia "Hypohamiltonian graph" · CC BY-SA 4.0
Share this article: X · Bluesky