def find_eulerian_tour2(graph):
    if not is_eulerian(graph):
        return []
    graph = edges(graph)
    E = graph[:]
    tour = []

    def find_tour2(u):
        for (i, j) in E:
            if i == u:
                E.remove((i, j))
                E.remove((j, i))
                find_tour2(j)
            elif j == u:
                E.remove((i, j))
                E.remove((j, i))
                find_tour2(i)
        tour.append(u)
    find_tour2(E[0][0])
    tour.reverse()

    return tour