Hypohamiltonian Graph

Hypohamiltonian Graph

In the mathematical field of graph theory, a 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.

Read more about Hypohamiltonian Graph:  History, Applications, Properties, Examples, Enumeration, Generalizations

Other articles related to "hypohamiltonian graph, graph, graphs, hypohamiltonian graphs":

Hypohamiltonian Graph - Generalizations
... Graph theorists have also studied hypotraceable graphs, graphs that do not contain a Hamiltonian path but such that every subset of n − 1 vertices may be connected by a path ... of hypohamiltonicity and hypotraceability for directed graphs have been considered by several authors ... An equivalent definition of hypohamiltonian graphs is that their longest cycle has length n − 1 and that the intersection of all longest cycles is ...

Famous quotes containing the word graph:

    When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.
    Marshall McLuhan (1911–1980)