𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approach to determining the minimum cut-set of a graph

✍ Scribed by A. I. Krapiva

Publisher
Springer US
Year
1979
Tongue
English
Weight
218 KB
Volume
14
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

An augmenting graph approach to the stab
An augmenting graph approach to the stable set problem in P5-free graphs
✍ Rodica Boliac; Vadim V. Lozin πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 149 KB

The complexity status of the stable set problem in the class of P5-free graphs is unknown. In the present paper we study an approach to the problem based on ΓΏnding augmenting graphs. The main result is that the stable set problem in the class of P5-free graphs is polynomially equivalent to the prob