✦ LIBER ✦

Stable sets of maximum weight in (, banner)-free graphs

✍ Scribed by Raffaele Mosca

Book ID: 108113795
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 221 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.03.044

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Stable sets in two subclasses of banner-

Stable sets in two subclasses of banner-free graphs

✍ Michael U. Gerber; Alain Hertz; Vadim V. Lozin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 219 KB

The maximum stable set problem is NP-hard, even when restricted to banner-free graphs. In this paper, we use the augmenting graph approach to attack the problem in two subclasses of banner-free graphs. We ÿrst provide both classes with the complete characterization of minimal augmenting graphs. Base

Some results on maximum stable sets in c

Some results on maximum stable sets in certain P5-free graphs

✍ Raffaele Mosca 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 149 KB

On maximum independent sets in -free gra

On maximum independent sets in -free graphs

✍ Bert Randerath; Ingo Schiermeyer 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 233 KB

Maximum independent sets in subclasses o

Maximum independent sets in subclasses of -free graphs

✍ Vadim Lozin; Raffaele Mosca 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 177 KB

Stable sets in k-colorable -free graphs

✍ Frédéric Maffray 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Maximum internally stable sets of a grap

Maximum internally stable sets of a graph

✍ S.L Hakimi; H Frank 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 711 KB