Definition, synonyms and related words
The problem of finding the shortest closed path or circuit that visits every edge of a (connected) undirected graph.