Bonds intersecting cycles in a graph (Q2568498)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2213259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bonds intersecting cycles in a graph |
scientific article; zbMATH DE number 2213259 |
Statements
Bonds intersecting cycles in a graph (English)
0 references
27 June 2006
0 references
A bond of a graph \(G\) is a minimum cut set of \(G\). It is proved that for a \(k\)-connected graph \(G\) with circumference \(c\geq 2k, k\geq 2\), there exists a bond which intersects every cycle of length \(c-k+2\) or greater. This result dualizes a result of the author in [Combinatorica 25, No.~4, 451--463 (2005; Zbl 1090.05039)].
0 references
bond
0 references
circumference
0 references
0.8226155042648315
0 references
0.8226155042648315
0 references
0.8030611872673035
0 references
0.7916319966316223
0 references
0.7735416889190674
0 references
