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.
Bonds Intersecting Cycles In A Graph
- Original Paper
- Published:
- Volume 25, pages 439–450, (2005)
- Cite this article
-
69 Accesses
-
2 Citations