✦ LIBER ✦

Clique-circulants and the stable set polytope of fuzzy circular interval graphs

✍ Scribed by Gianpaolo Oriolo; Gautier Stauffer

Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 528 KB
Volume: 115
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-007-0176-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On non-rank facets of the stable set pol

On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs

✍ Thomas M. Liebling; Gianpaolo Oriolo; Bianca Spille; Gautier Stauffer 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 297 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