Noun
Hamiltonian path (plural Hamiltonian paths)
(graph theory) A path through a graph which visits each vertex exactly once.
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