Well, they're not related in that they are not the same problem, but they are related in that you can solve both using the properties of bipartite graphs. I th

Well, they're not related in that they are not the same problem, but they are related in that you can solve both using the properties of bipartite graphs. I think I was correct in the post—I never actually stated that domino-covering is equivalent to the Hamiltonian path problem. The entire point of the post was really that we can use graph theory to generalize certain properties and solve a number of different unrelated problems, not to equate all problems. I did mistakenly imply that the domino covering was a path (which you're right, it's not) at one point. I have edited the post for clarity.