摘要
凡未作解释的术语均可参考Bondy和Murty的书。 一个图G=(V,E),如果满足如下的性质A和B,则称之为核心图。所有核心图的集合记为。 性质A存在一个整数K≥1使得:(i)V=V_o+V_1+…+V_k;(ii)G[V-V_o)=G[V_1)
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 .
