关于无爪Hamilton图的一个泛圈性结果(英文).pdfVIP

Journal of M athem atical R esearch Expo sition Vo l18, No2, 165- 172, M ay 1998 A Cycle Theorem for Ham ilton ian Graphs w ithout K 1, 3 R en H an ( , , 100044) D epartm ent of M athem atics N o rthern J iao tong U niversity Beijin 　 = ( , ) ( ) V [ ( ) ] Abstract L et G V E be a ham iltonian K 1. 3 free graph such that d x 2 and G N x is con . . nected fo r som e vertex x of G Then G is pancyclic w ith a few num ber of excep tions 　 , , Keywords K 1. 3 free graph ham iltonian graph pancyclic graph 　 ( 1991) 05 45 157. 5 Classif ication AM S C CCL O 1. In troduction . A ll graph s con sidered here are sim p le graph s w ithou t loop s o r m u ltip le edges T erm s no t m en tioned can be found in [1 ]. L et G= (V , E ) be a graph w ith oder n. If G con tain s a k k = 3, 4, …, , . ∈ , ( ) ( ) cycle C fo r k n then it is called pancyclic Fo r x V N x and d x is the . , A ( ) neighbo rhood and degree of x in G respectively Generally