For a graph, if each vertex has an even degree, we can find an E

For a graph, if each vertex has an even degree, we can find an Euler circuit that visits every vertex exactly once. ~@[](2)

答案：FALSE