Cycles through a prescribed vertex set in N-connected graphs

A well-known result of Dirac (Math. Nachr. 22 (1960) 61) says that given n vertices in an n-connected G, G has a cycle through all of them. In this paper, we generalize Diracʹs result as follows: at most 32 n vertices in an n-connected graph G when n⩾3 and |V(G)|⩾32 n, then G has a cycle through exactly n vertices of them. mproves the previous known bound given by Kaneko and Saito (J. Graph Theory 15(6) (1991) 655).