𝔖 Bobbio Scriptorium
✦   LIBER   ✦

How to draw the minimum cuts of a planar graph

✍ Scribed by Ulrik Brandes; Sabine Cornelsen; Christian Fieß; Dorothea Wagner

Book ID
108100913
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
321 KB
Volume
29
Category
Article
ISSN
0925-7721

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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
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