Hamiltonian cycle

Notice the path in red. The yellow nodes and black links form a Hamiltonian cycle.

This is a portion of an undirected graph in which the nodes are linked together in a way that forms a cycle. Ie, node A links to node B, which then link back to node A. Such a concept has been described extensively in other articles. See the external link(s).