Hamiltonian path

(redirected from Traceable 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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

Hamiltonian path

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
References in periodicals archive ?
Question 1 Is 9 the smallest order of a connected nontraceable locally traceable graph?
We develop a technique to construct connected locally hamiltonian and locally traceable graphs that are not traceable.