𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stable sets in k-colorable -free graphs

✍ Scribed by Frédéric Maffray

Book ID
108154668
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
135 KB
Volume
109
Category
Article
ISSN
0020-0190

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

Coloring planar Toeplitz graphs and the
Coloring planar Toeplitz graphs and the stable set polytope
✍ Reinhardt Euler 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 290 KB

Cliques and odd cycles are well known to induce facet-deÿning inequalities for the stable set polytope. In graph coloring cliques are a class of n-critical graphs whereas odd cycles represent the class of 3-critical graphs. In the ÿrst part of this paper we generalize both notions to (Kn \ e)-cycles

Minimum Coloring k-Colorable Graphs in P
Minimum Coloring k-Colorable Graphs in Polynomial Average Time
✍ C.R. Subramanian 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 137 KB

We present algorithms for minimum G -coloring k-colorable graphs drawn from random and semi-random models. In both models, an adversary initially splits Ž . the vertices into k color classes V , . . . , V of sizes ⍀ n each. In the first model,