𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering a graph with cuts of minimum total size

✍ Scribed by Zoltán Füredi; André Kündgen

Book ID
108315586
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
179 KB
Volume
237
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering skew-supermodular functions by
Covering skew-supermodular functions by hypergraphs of minimum total size
✍ Attila Bernáth; Tamás Király 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 1020 KB

The paper presents results related to a theorem of Szigeti on covering symmetric skew-supermodular set functions by hypergraphs. We prove the following generalization using a variation of Schrijver's supermodular colouring theorem: if p 1 and p 2 are skew-supermodular functions with the same maximum

On the Number of Minimum Cuts in a Graph
On the Number of Minimum Cuts in a Graph
✍ Chandran, L. Sunil; Ram, L. Shankar 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 253 KB
3-connected graphs with non-cut contract
3-connected graphs with non-cut contractible edge covers of size k
✍ Xingxing Yu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 493 KB 👁 1 views

## Abstract In this paper, we show that if a 3‐connected graph __G__ other than __K__~4~ has a vertex subset __K__ that covers the set of contractible edges of __G__ and if |__K__| 3 and |__V(G)__| 3|__K__| − 1, then __K__ is a cutset of __G__. We also give examples to show that this result is best