View Related Documents

Abstract

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.

Mathematics Subject Classification (2000):  05C38 - 05C35

Fulltext Preview

Image of the first page of the fulltext document