×

zbMATH — the first resource for mathematics

A new sufficient condition for Hamiltonian graphs. (English) Zbl 0606.05043
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

MSC:
05C45 Eulerian and Hamiltonian graphs
Keywords:
hamiltonicity
PDF BibTeX XML Cite
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.