Hamiltonian path

(redirected from Hamilton graph)

Hamiltonian path

[‚ham·əl′tō·nē·ən ‚path]
(mathematics)
A path along the edges of a graph that traverses every vertex exactly once and terminates at its starting point. Also known as Hamiltonian circuit; Hamiltonian cycle.

Hamiltonian path

References in periodicals archive ?
A graph containing a spanning cycle is called a Hamilton graph.

Full browser ?