This paper discusses the application of degree in other aspects of graph theory, such as cycle, Hamiltonian graph and matching on the base of reference.
在已有文献的基础上，讨论度在图论其它方面，诸如在圈、哈密顿图、匹配中的应用。
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.
作者曾提出利用王氏代数产生图的全部哈密顿圈，本文继续研究了这种算法。
According to the orbit of adjoining matrix of directed graph the problem of Hamiltonian cycle is described.
通过有向图的邻接矩阵的轨道来刻划图的哈密顿圈问题。
If G is Hamiltonian, then its line graph L(G) is pancyclic graph.
若G是哈密顿图，则其线图L（G）是泛圈图。
The interdependent relationship between the Hamiltonian cycle and 4-colouring of the planar graph in the dual have discussed.
阐明了平图中的H圈与对偶图顶点四着色的依存关系。
The interdependent relationship between the Hamiltonian cycle and 4-colouring of the planar graph in the dual have discussed.
阐明了平图中的H圈与对偶图顶点四着色的依存关系。
应用推荐