在连通平面图上找Hamilton回路的一个方法

以图Ｇ的面为节点构造着色面状态树，用深度优选搜索法在状态树上找完全子树，以求对应的Ｈａｍｉｌｔｏｎ回路。为了把图Ｇ的全部Ｈａｍｉｌｔｏｎ回路都找出来，所需构造的着色面状态数的数目不会超过一个定值。

A Method for Finding Hamiltonian Circuits on Intersected Graphs

Faces of a graph G are defined as nodes,which are used to construct state trees of chromatic faces.The depth first algorithm is then used to search for complete subtrees on the state trees,so that the corresponding Hamiltonian circuits could be found.The number of the state trees to be constructed will be a definite value to find out all Hamiltonian circuits,if these circuits exist,of a graph G.