Hamiltonian path

Noun

Meaning

Hamiltonian path (plural Hamiltonian paths)

(graph theory) A path through a graph which visits each vertex exactly once.

Source: en.wiktionary.org

Examples

The "compulsory" edges of the fragments, that must be part of any Hamiltonian path through the fragment, are connected at the central vertex; because any cycle can use only two of these three edges, there can be no Hamiltonian cycle. Source: Internet

Close letter words and terms

Hamiltonian cycle Hamiltonian graph Hamiltonian operator Hamiltonian spite Hamiltonianism Hamiltonianness