𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simple test on 2-vertex- and 2-edge-connectivity

✍ Scribed by Schmidt, Jens M.

Book ID
120192659
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
194 KB
Volume
113
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Static 2-Approximation Algorithm for V
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
✍ Monika Rauch Henzinger πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 329 KB

This paper presents insertions-only algorithms for maintaining the exact andror approximate size of the minimum edge cut and the minimum vertex cut of a graph. Ε½ . The algorithms output the approximate or exact size k in time O 1 and a cut of size k in time linear in its size. For the minimum edge

The existence of a 2-factor in K1, n-fre
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity
✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 130 KB πŸ‘ 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n β‰₯ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.