𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Perfect Matchings Versus Odd Cuts

✍ Scribed by Zoltán Szigeti


Book ID
106167456
Publisher
Springer-Verlag
Year
2002
Tongue
English
Weight
207 KB
Volume
22
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Odd Minimum Cut Sets and b -Matchings Re
✍ Letchford, Adam N.; Reinelt, Gerhard; Theis, Dirk Oliver 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 151 KB
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