I understand that a HAM-Path must cover all vertices without necessarily touching all edges. But, if a graph has, lets say, 2 edge-disjoint HAM-Paths, will both of these paths touch the same amount of edges?
In a sense, it makes sense, but I am not quite sure. I can't find a lot of literature on the issue.
Will this always hold?