There is a path reaching every vertex where each edge occurs only once vs not so
COMMENTS
This kind of path is called and Eulerian path, and this problem comes from the historical "7 Bridges of Königsberg." The configuration of the bridges is given as a right example.