Fraisse, Pierre A new sufficient condition for Hamiltonian graphs. (English) Zbl 0606.05043 J. Graph Theory 10, No. 3, 405-409 (1986). In this paper, the following result is obtained: Let G be a k-connected graph of order n. If the number of neighbors of every independent set of k vertices is greater than \((k(n-1))/(k+1)\), then G is hamiltonian. Reviewer: F.Tian Cited in 3 ReviewsCited in 12 Documents MSC: 05C45 Eulerian and Hamiltonian graphs Keywords:hamiltonicity PDFBibTeX XMLCite \textit{P. Fraisse}, J. Graph Theory 10, No. 3, 405--409 (1986; Zbl 0606.05043) Full Text: DOI References: [1] Chvátal, Discrete Math. 2 pp 111– (1972) [2] , , and , Neighborhood unions and properties in graphs. Tech. Rep. 3, Emory Univ. Dep. Math. Comput. Sci. 1985. [3] Skupien, Rostock Math. Kolloq. 11 pp 97– (1979) This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.