Abstract
The well-known Ore’s theorem (see Ore in Am Math Mon 65:55, 1960), states that a graph G of order n such that d(x) + d(y) ≥ n for every pair {x, y} of non-adjacent vertices of G is Hamiltonian. In this paper, we considerably improve this theorem by proving that in a graph G of order n and of minimum degree δ ≥ 2, if there exist at least n − δ vertices x of G so that the number of the vertices y of G non-adjacent to x and satisfying d(x) + d(y) ≤ n − 1 is at most δ − 1, then G is Hamiltonian. We will see that there are graphs which violate the condition of the so called “Extended Ore’s theorem” (see Faudree et al. in Discrete Math 307:873–877, 2007) as well as the condition of Chvatál’s theorem (see Chvátal in J Combin Theory Ser B 12:163–168, 1972) and the condition of the so called “Extended Fan’ theorem” (see Faudree et al. in Discrete Math 307:873–877, 2007), but satisfy the condition of our result, which then, only allows to conclude that such graphs are Hamiltonian. This will show the pertinence of our result. We give also a new result of the same type, ensuring the existence of a path of given length.
Similar content being viewed by others
References
Bondy J.A., Murty U.S.R.: Graph Theory. Springer, Berlin (2008)
Chvátal V.: On Hamilton’s ideals. J. Combin. Theory Ser. B 12, 163–168 (1972)
Dirac G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69–81 (1952)
Erdös P., Gallai T.: maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hung. 10, 337–356 (1959)
Erdös P., Gallai T.: Graphs with prescribed degrees of vertices. Mat. Lapok 11, 264–274 (1960) (Hungarian)
Faudree R.J., Schelp R.H., Saito A., Schiermeyer I.: Degree conditions for hamiltonicity: counting the number of missing edges. Discrete Math. 307, 873–877 (2007)
Ore O.: Note on Hamiltonian circuits. Am. Math. Mon. 65, 55 (1960)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lichiardopol, N. New Ore’s Type Results on Hamiltonicity and Existence of Paths of Given Length in Graphs. Graphs and Combinatorics 29, 99–104 (2013). https://doi.org/10.1007/s00373-011-1096-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-011-1096-0