证明有度连通图= 2的哈密顿圈哈密

2023-09-11 07:21:14 作者:卖掉裤衩来上网

原谅我,如果我的问题是重复的,但我找不到一个完整的答案,证明一个连通图,所有的顶点有度= 2是一个Hamilton图。

excuse me if my question is repeated but i couldn't find a complete answer to prove that a connected graph which all vertices has degree = 2 is a hamiltonian graph.

我读this和this

推荐答案

让给定的图形是