cycle
in graph theory, non-empty trail in which only the first and last vertices are equal
loop
edge connecting a vertex to itself
self-avoiding polygon
closed walk on a lattice that does not intersect itself
Hamiltonian cycle
Hamiltonian path that is a cycle