Nacionalni portal odprte znanosti

Label the vertices of the complete graph K_v with the integers {0, 1, …, v − 1} and define the length l of the edge between distinct vertices labeled x and y by ℓ(x, y) = min (|y − x|,v − |y − x|). A realization of a multiset L of size v − 1 is a Hamiltonian path through K_v whose edge labels are L. ...