让G(V,E)是n阶图,在Ore条件下,即G的不相邻的任意两点x,y均有d(x)+d(y)≥n,则G是Hamilton图.进一步考虑G的不相邻的任意两点x,y均有d(x)+d(y)≥n-1,和长为2的任意两点x,y均有d(x)+d(y)≥n-1,两个条件下G的Hamilton性.
[1] Dirac G A. Some theorems on abstract graphs [J]. Proceedings of the London Mathematical Society 1952, 3(02).
[2] Ore O. Note on hamilton circuits [J]. American Mathematical Monthly 1960, 67.
[3] Bondy J A, MURTY U S R. Graph theory with applications [M]. London:Macmillan 1976.