Abstract
Letk andλ be positive integers, andG a 2-connected graph of ordern with minimum degreeδ and independence numberα. A cycleC ofG is called aD λ-cycle if every component ofG − V(C) has order smaller thanλ. The graphG isk-cyclable if anyk vertices ofG lie on a common cycle. A previous result of the author is that ifλ ≥ k ≥ 2, G isk-connected and every connected subgraphH ofG of orderλ has at leastn +k 2 + 1/k + 1 −λ vertices outsideH adjacent to at least one vertex ofH, thenG contains aD λ-cycle. Here it is conjectured that “k-connected” can be replaced by “k-cyclable”, and this is proved fork = 3. As a consequence it is shown that ifn ≤ 4δ − 6, or ifG is triangle-free andn ≤ 8δ − 10, thenG contains aD 3-cycle orG ∈ ℱ, whereℱ denotes a well-known class of nonhamiltonian graphs of connectivity 2. As an analogue of a result of Nash-Williams it follows that ifn ≤ 4δ − 6 andα ≤δ − 1, thenG is hamiltonian orG ∈ ℱ. The results are all best possible and compare favorably with recent results on hamiltonicity of graphs which are “close to claw-free”.
Similar content being viewed by others
References
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London and Elsevier, New York (1976)
Broersma, H.J., Ryjáček, Z., Schiermeyer, I.: Toughness and hamiltonicity in almost claw-free graphs. J. Graph Theory (to be published)
Fan, G.: Extremal theorems on paths and cycles in graphs and weighted graphs. Thesis, University of Waterloo, Waterloo, Ontario (1987)
Jung, H.A.: Long cycles in graphs with moderate connectivity. In Topics in Combinatorics and Graph Theory, R. Bodendiek and R. Henn eds., Physica-verlag, Heidelberg (1990) 765–778
Li, H.: Hamiltonian cycles in 2-connected claw-free graphs. Preprint
Li, H., Lu, M., Sun, Z.: Hamiltonicity in 2-connected graphs with claws. Preprint
Matthews, M.M., Sumner, D.P.: Longest paths and cycles inK 1, 3-free graphs. J. Graph Theory9, 269–277 (1985)
Aung, Min: Longest cycles in triangle-free graphs. J. Comb. Theory Ser.B 47, 171–186 (1989)
Nash-Williams, C.St.J.A.: Edge-disjoint hamiltonian circuits in graphs with vertices of large valency. In Studies in Pure Mathematics, L. Mirsky ed., Academic Press, London (1971) 157–183.
Veldman, H.J.: Existence ofD λ-cycles andD λ-paths. Discrete Math.44, 309–316 (1983)
Watkins, M.E., Mesner, D.M.: Cycles and connectivity in graphs. Canad. J. Math.19, 1319–1328 (1967)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Veldman, H.J. D λ -cycles in 3-cyclable graphs. Graphs and Combinatorics 11, 379–388 (1995). https://doi.org/10.1007/BF01787817
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01787817
Keywords
- Hamilton cycle
- hamiltonian graph
- D λ-cycle
- k-cyclable graph
- degree
- independence number
- claw-free graph
- claw-center
- triangle-free graph