Balloons, cut-edges, matchings, and tota
β
Suil O; Douglas B. West
π
Article
π
2009
π
John Wiley and Sons
π
English
β 148 KB
π 1 views
## Abstract A __balloon__ in a graph __G__ is a maximal 2βedgeβconnected subgraph incident to exactly one cutβedge of __G__. Let __b__(__G__) be the number of balloons, let __c__(__G__) be the number of cutβedges, and let Ξ±β²(__G__) be the maximum size of a matching. Let \documentclass{article}\usep