摘要
在［２］中有结果：如果Ｇ是ｎ阶２连通图，ＸＶ（Ｇ）并且ＮＣ２（Ｘ）≥ｎ－１２，则Ｇ是Ｘ可迹图．本文利用该结果推广了Ｄｉｒａｃ和Ｏ．Ｏｒｅ分别在文献［３］和［４］中有关可迹图方面的结论。
There is a result in , i.e., if G is a 2connected graph of order n , XV(G) and NC 2(X)≥n-12 , then G is Xtraceable. In this paper, from the result we obtain two corollaries that generalize previous results of Dirac and O.Ore in Xtraceable graph.
出处
《云南师范大学学报（自然科学版）》
1997年第3期18-20,共3页
Journal of Yunnan Normal University:Natural Sciences Edition
基金
云南省教委科研基金
关键词
邻域并
独立集
X-可迹图
neighborhood unions (X)traceable graph independent set
