Skip to main content
Log in

Bonds Intersecting Cycles In A Graph

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

Let G be a k-connected graph G having circumference c ≥ 2k. It is shown that for k ≥ 2, then there is a bond B which intersects every cycle of length c-k + 2 or greater.

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

Access this article

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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sean McGuinness.

Rights and permissions

Reprints and permissions

About this article

Cite this article

McGuinness, S. Bonds Intersecting Cycles In A Graph. Combinatorica 25, 439–450 (2005). https://doi.org/10.1007/s00493-005-0026-6

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-005-0026-6

Mathematics Subject Classification (2000):

Navigation