Decomposition of complete graph into cycles through all vertices.
Continuing explanation [here][1],
Next explanation is given as
for $n=5$ , $n=7$, it suffices to use cycles formed by traversing the
vertices with constant difference:$\left(0,1,2,3,4\right)$,$\left(0,2,4,1,3\right)$ for $n=5 $
and
$\left(0,1,2,3,4,5,6\right)$,$\left(0,3,6,2,5,1,4\right)$ for $n=7 $
Not getting how
$\left(0,1,2,3,4\right)$,$\left(0,2,4,1,3\right)$ and $\left(0,1,2,3,4,5,6\right)$,$\left(0,3,6,2,5,1,4\right)$ is coming from !!!!!
Please help me out!!
[1]:
http://math.stackexchange.com/questions/1985647/decomposition-of-complete-graph-into-cycles-through-all-vertices/1985652#1985652