Bonds Intersecting Cycles In A Graph

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, access via your institution.

Author information

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

Mathematics Subject Classification (2000):

  • 05C38
  • 05C35