Abstract
Let Gbe a 2-connected graph with minimum degree d and let {x, y, z} be a set of three vertices contained on some cycle ofG. ThenG ishamiltonian or {x, y, z} is contained on a cycle of length at least 2d inG.
Similar content being viewed by others
References
Bondy, J.A. and Murty, U.S.R.: Graph Theory with Applications. Elsevier North-Holland, New York (1976)
Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. Soc.2, 69–81 (1952)
Dirac, G.A.: In abstrakten Graphen vorhandene vollstandige 4-Graphen und ihre Unterteilungen. Math. Nachr.22, 61–85 (1960)
Egawa, Y., Glas, R. and Locke, S.C.: Cycles through specified vertices ink-connected graphs. J. Comb. Theory Ser.B, scheduled to appear in Volume 51 (February 1991)
Fan, G.: Extremal Theorems on Paths and Cycles in Graphs and Weighted Graphs. Ph.D. Thesis. University Waterloo (1987)
Locke, S.C.: Extremal Properties of Paths, Cycles andk-Colourable Subgraphs of Graphs. Ph.D. Thesis. University of Waterloo (1982)
Locke, S.C.: A generalization of Dirac's theorem. Combinatorica5, 149–159 (1985)
Perfect, H.: Application of Menger's graph theorem. J. Math. Annal. Appl.22, 96–111 (1968)
Saito, A.: Long cycles through specified vertices in a graph. J. Comb. Theory Ser. B47, 220–230 (1989)
Tutte, W.T.: Connectivity in Graphs. University of Toronto Press (1966)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Locke, S.C., Zhang, CQ. Cycles through three vertices in 2-connected graphs. Graphs and Combinatorics 7, 265–269 (1991). https://doi.org/10.1007/BF01787632
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01787632