Is the problem of navigating a graph \( G \) such that you visit every vertex only once and then return to your start point. This is only possible on eulerian graphs.