哈密顿圈

图的坚韧度和独立数与哈密顿圈

The Toughness and Independent Number and Hamilton Cycle of graph

四正则平面图与其对偶图的哈密顿圈

The 4-regular plane graph and Hamilton cycle of dual graph

给出了角上有两个洞的4×n（n≥4）棋盘中的马步哈密顿圈的解。

The solutions to the knight 's circuit problem in the 4 × n ( n ≥ 4 ) chessboard with two holes are given in this paper .

证明如下结论：设G是连通、N2-局部连通、δ≥6的K1,4-受限图，如果G中不含有同构于G1，G2或G3的导出子图H，则G含哈密顿圈。

It is shown that let G is a connected , N 2-locally connected K 1,4 - restricted graph with δ≥ 6 , which does not contain an induced subgraph H isomorphic to one of G 1 , G 2 and G 3 , then G is hamiltonian .

证明了在至多具有2n-3条故障边的n维（n≥3）折叠超立方体网络中，如果每个顶点至少与两条非故障边相邻，则存在一个不含故障边的哈密顿圈。

For any n-dimensional ( n ≥ 3 ) folded hypercube with at most 2n-3 faulty edges in which each vertex is incident with at least two fault-free edges , it is proved that there exists a fault-free Hamiltonian cycle .

关于产生哈密顿圈的定理及其应用

On the theorem of generating Hamiltonian cycles and Its Applications

平面化图的哈密顿圈的产生

Generation of All Hamiltonian Cycles in a Plane Graph

线图中的哈密顿圈

On Hamiltonian Cycle in Line Graph

通过有向图的邻接矩阵的轨道来刻划图的哈密顿圈问题。

According to the orbit of adjoining matrix of directed graph the problem of Hamiltonian cycle is described .

对计算困难程度来说，这一类问题的所有问题是等价的。这类问题包含很多实际上重要而又值得研究的问题，例如整数规划问题和哈密顿圈问题。

They contain such important problems as the integer-programming and the Hamiltonian circuit problems which are worth studying but equally difficult to compute .

利用分治-合并的思想，本文设计了一个算法，可以很快地在国际象棋棋盘上找到马的周游路线（哈密顿圈）。

Based on the thought of dividing and conquering-merge , an algorithm is designed , with which the knight 's tour on an international chessboard can be quickly found .

本文提出如何利用修正的王氏积产生平面化图的全部哈密顿圈。

This paper is to show how a modified Wang product can be used to generate all the Hamiltonian cycles in a plane graph with considerably less computation than previousely reported .

作者曾提出利用王氏代数产生图的全部哈密顿圈，本文继续研究了这种算法。

In this paper the study of the algorithm which has been done by the author for generating all the Hamiltonian cycles in a graph by a method of Wang algebra is continued .