𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Odd Minimum Cut Sets and b -Matchings Revisited

✍ Scribed by Letchford, Adam N.; Reinelt, Gerhard; Theis, Dirk Oliver


Book ID
118197631
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
151 KB
Volume
22
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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