For a graph, if each vertex has an even degree or only two verte

For a graph, if each vertex has an even degree or only two vertexes have odd degree, we can find a cycle that visits every edge exactly once ~@[](2)

答案：FALSE