𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recognizing Berge Graphs

✍ Scribed by Maria Chudnovsky*; Gérard Cornuéjols**; Xinming Liu†; Paul Seymour†; Kristina Vušković‡

Book ID
106167544
Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
490 KB
Volume
25
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognizing decomposable graphs
Recognizing decomposable graphs
✍ V. Chvátal 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

## Abstract A graph is called decomposable if its vertices can be colored red and blue in such a way that each color appears on at least one vertex but each vertex v has at most one neighbor having a different color from v. We point out a simple and efficient algorithm for recognizing decomposable

Bull-Reducible Berge Graphs are Perfect
Bull-Reducible Berge Graphs are Perfect
✍ Hazel Everett; Celina M.H. de Figueiredo; Sulamita Klein; Bruce Reed 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 182 KB
On weakly diamond-free Berge graphs
On weakly diamond-free Berge graphs
✍ Hacène Ait Haddadene; Sylvain Gravier 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 183 KB

In this paper, we present a new class of graphs named weakly diamond-Jree (WDF) graphs and we prove for it the strong perfect graph conjecture, by exhibiting a polynomial sequential (,)-coloring algorithm. This class contains chordal graphs and perfect line-graphs.

New classes of Berge perfect graphs
New classes of Berge perfect graphs
✍ C. De Simone; A. Galluccio 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 823 KB

In this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes of graphs described by forbidden configurations. Three different kinds of techniques are used: the first is the well-known star-cutset technique, the second involves a clique-reduction operation, and the thi