For a connected graph, if there are exactly two vertices having

For a connected graph, if there are exactly two vertices having odd degree, we can find an Euler circuit that visits every vertex exactly once by starting from one of its odd-degree vertices. ~@[](2)

答案：FALSE