Eulerian and Hamiltonian Graphs · Medium problem

A double-six domino set has $28$ dominoes: all pairs $(i,j)$ with $0 \le i \le j \le 6$. Model this as a multigraph where vertices $0,\ldots,6$ represent the numbers, and each domino $(i,j)$ is an edge from $i$ to $j$ (a loop if $i=j$). Can all $28$ dominoes be laid out in a closed ring so that touching dominoes have matching numbers on their edges?