BabelNet

bn:01070385n

Noun Concept

Categories: Graph families, Hamiltonian paths and cycles

hypohamiltonian graph

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

Definitions

Relations

Sources

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

IS A

HAS KIND

HAS INSTANCE