Skip to main content
Springer Nature Link
Log in

Cycles through three vertices in 2-connected graphs

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bondy, J.A. and Murty, U.S.R.: Graph Theory with Applications. Elsevier North-Holland, New York (1976)

    Google Scholar 

  2. Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. Soc.2, 69–81 (1952)

    Google Scholar 

  3. Dirac, G.A.: In abstrakten Graphen vorhandene vollstandige 4-Graphen und ihre Unterteilungen. Math. Nachr.22, 61–85 (1960)

    Google Scholar 

  4. 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)

  5. Fan, G.: Extremal Theorems on Paths and Cycles in Graphs and Weighted Graphs. Ph.D. Thesis. University Waterloo (1987)

  6. Locke, S.C.: Extremal Properties of Paths, Cycles andk-Colourable Subgraphs of Graphs. Ph.D. Thesis. University of Waterloo (1982)

  7. Locke, S.C.: A generalization of Dirac's theorem. Combinatorica5, 149–159 (1985)

    Google Scholar 

  8. Perfect, H.: Application of Menger's graph theorem. J. Math. Annal. Appl.22, 96–111 (1968)

    Google Scholar 

  9. Saito, A.: Long cycles through specified vertices in a graph. J. Comb. Theory Ser. B47, 220–230 (1989)

    Google Scholar 

  10. Tutte, W.T.: Connectivity in Graphs. University of Toronto Press (1966)

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Florida Atlantic University, 33431, Boca Raton, Florida, USA

    S. C. Locke

  2. Department of Mathematics, West Virginia University, 26506, Morgantown, West Virginia, USA

    Cun-Quan Zhang

Authors
  1. S. C. Locke
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Cun-Quan Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01787632

Keywords