Abstract
LetG be ak-connected (k ≥ 2) graph onn vertices. LetS be an independent set ofG. S is called essential if there exist two distinct vertices inS which have a common neighbor inG. LetV r, be a clique which is a complete subgraph ofG. In this paper it is proven that if every essential independent setS ofk + 1 vertices satisfiesS ∩ V r ≠ ∅, thenG is hamiltonian, orG∖{u} is hamiltonian for someu ∈ V r, orG is one of three classes of exceptional graphs. Our theorem generalizes several well-known theorems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bondy, J.A.: Longest paths and cycles in graphs of high degree. Research Report CORR80-16, Univ. of Waterloo, Ontario (1980)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London, and Elsevier, New York (1976)
Chvátal, V., Erdös, P.: A note on hamiltonian circuits. Discrete Math.2, 111–136 (1972)
Egawa, Y., Saito, A.: Essential independent set and hamiltonian cycles. Preprint (1994)
Fan, G.: New sufficient conditions for cycles in graphs. J. Comb. Theory, SerB, 37, 221–227 (1984)
Liu, X., Wei, B.: A generalization of Bondy's and Fan's sufficient conditions for hamiltonian graphs, preprint, 1994,4
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Liu, X. Independent sets, cliques and hamiltonian graphs. Graphs and Combinatorics 11, 267–273 (1995). https://doi.org/10.1007/BF01793014
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01793014