✦ LIBER ✦

On the Number of Minimum Cuts in a Graph

✍ Scribed by Chandran, L. Sunil; Ram, L. Shankar

Book ID: 118199548
Publisher: Society for Industrial and Applied Mathematics
Year: 2004
Tongue: English
Weight: 253 KB
Volume: 18
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480103427138

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of small cuts in a graph

✍ Monika Henzinger; David P. Williamson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 356 KB

Graphs with the smallest number of minim

Graphs with the smallest number of minimum cut sets

✍ Derek Smith 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

The number of cut-vertices in a graph of

The number of cut-vertices in a graph of given minimum degree

✍ Michael O. Albertson; David M. Berman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Albertson, M.O. and D.M. Berman, The number of cut-vertices in a graph of given minimum degree, Discrete Mathematics 89 (1991) 97-100. A graph with n vertices and minimum degree k 2 2 can contain no more than (2k -2)n/(kz -2) cut-vertices. This bound is asymptotically tight. \* Research supported in

A note on the minimum cut cover of graph

A note on the minimum cut cover of graphs

✍ Ho Tung-Yang; Hsu Lih-Hsing 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 105 KB

How to draw the minimum cuts of a planar

How to draw the minimum cuts of a planar graph

✍ Ulrik Brandes; Sabine Cornelsen; Christian Fieß; Dorothea Wagner 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 321 KB

Covering a graph with cuts of minimum to

Covering a graph with cuts of minimum total size

✍ Zoltán Füredi; André Kündgen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 179 KB