一个Hamilton图形充分性的研究

A Study of the Sufficient Property for Hamilton Graph

讨论了特殊的 4k(k >1)个结点的简单图中存在Hamilton回路的充分性 ,并由此提出 :具有 4k个结点的 (2k - 1)正则简单图都是Hamilton图 .

The sufficient property that Hamilton Circuit exists in the special and simple graph with 4 nodes is discussed.A conclusion is made that the (2 k -1)-canonical and simple graph with 4 nodes are Hamilton Graph.