𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stable Set Polytopes for a Class of Circulant Graphs

✍ Scribed by Dahl, Geir


Book ID
118204373
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
322 KB
Volume
9
Category
Article
ISSN
1052-6234

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The stable set polytope of quasi-line gr
✍ Friedrich Eisenbrand; Gianpaolo Oriolo; Gautier Stauffer; Paolo Ventura πŸ“‚ Article πŸ“… 2008 πŸ› Springer-Verlag 🌐 English βš– 342 KB
Clique family inequalities for the stabl
✍ 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