BabelNet

bn:01070385n

Noun Concept

No term available

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. Wikipedia

Relations

Sources

IS A

HAS KIND

HAS INSTANCE

NAMED AFTER

William Rowan Hamilton

STUDIED BY

teoría de grafos