✦ LIBER ✦

Bull-free Berge graphs are perfect

✍ Scribed by Vašek Chvátal; Najiba Sbihi

Book ID: 105309437
Publisher: Springer Japan
Year: 1987
Tongue: English
Weight: 774 KB
Volume: 3
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788536

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bull-Reducible Berge Graphs are Perfect

✍ Hazel Everett; Celina M.H. de Figueiredo; Sulamita Klein; Bruce Reed 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Recognizing bull-free perfect graphs

✍ Bruce Reed; Najiba Sbihi 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 528 KB

Coloring Bull-Free Perfect Graphs

✍ Penev, Irena 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 359 KB

Optimizing Bull-Free Perfect Graphs

✍ de Figueiredo, Celina M. H.; Maffray, Frédéric 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 189 KB

The Structure of Bull-Free Perfect Graph

The Structure of Bull-Free Perfect Graphs

✍ Maria Chudnovsky; Irena Penev 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 727 KB

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