摘要
利用邻域交的概念，应用插点的方法，给出了一类与图的哈密顿性有关的序列，推广了关于哈密顿图、哈密顿连通图、以及图的支配路和图的一些已知的定理．
A class of sequences concerning the hamiltonicity of graphs i. giv,n by the concept of neighborhood intersections and the vertex inserting lemmas. These results imply several known theorems on the topic of hamiltonian graph, hamilton connected graph. and dominating paths and cycles in the graph theory.
出处
《南京师大学报（自然科学版）》
CAS
CSCD
1995年第1期19-28,34,共11页
Journal of Nanjing Normal University(Natural Science Edition)
关键词
图论
哈密顿性
序列
圈
路
sequence
hamiltonian
dominating
cycle
path
