刘彦佩.关于图的Hamilton性[J].数学研究及应用,1989,9(1):121~124
关于图的Hamilton性
On tne Hamiltonianity of a Graph
投稿时间:1986-11-22  
DOI:10.3770/j.issn:1000-341X.1989.01.020
中文关键词:  
英文关键词:
基金项目:
作者单位
刘彦佩 中国科学院应用数学研究所 
摘要点击次数: 1520
全文下载次数: 1199
中文摘要:
      
英文摘要:
      This paper provides a necessary and sufficient condition of a graph being Hamiltonian. On the sufficiency, it is surely wider than that of the closure being the complete graph. Therefore, all the conditions related to the closure being the complete graph, e.g., Dirac's, Ore's et al, and some others with the closure being not the complete graph, especially the one obtained recently by Fan can be easily derived .
查看全文  查看/发表评论  下载PDF阅读器