An eulerian path in a graph is a path that visits every edge in the graph exactly once.
If there is a path that has a similar property that it visits an edge at most once (e.g. a part of an eulerian path has this property), is there a name for such path (like "eulerian" is for the one described above)?