๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the stable set polytope of a series-parallel graph

โœ Scribed by A. R. Mahjoub

Publisher
Springer-Verlag
Year
1988
Tongue
English
Weight
204 KB
Volume
40-40
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The stable set polytope of quasi-line gr
The stable set polytope of quasi-line graphs
โœ Friedrich Eisenbrand; Gianpaolo Oriolo; Gautier Stauffer; Paolo Ventura ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 342 KB
Stability critical graphs and ranks face
Stability critical graphs and ranks facets of the stable set polytope
โœ E.C. Sewell; L.E. Trotter Jr. ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 616 KB

Rank inequalities due to stability critical (u-critical) graphs are used to develop a finite nested sequence of linear relaxations of the stable set polytope, the strongest of which provides an integral max-min relation: In a simple graph, the maximum size of a stable set is equal to the minimum (we

Clique family inequalities for the stabl
Clique family inequalities for the stable set polytope of quasi-line graphs
โœ G. Oriolo ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 248 KB

In one of fundamental works in combinatorial optimization, Edmonds gave a complete linear description of the matching polytope. Matchings in a graph are equivalent to stable sets in its line graph. Also the neighborhood of any vertex in a line graph partitions into two cliques: graphs with this latt