✦ LIBER ✦

Graph Classes: A Survey || 14. The Strong Perfect Graph Conjecture

✍ Scribed by Brandstädt, Andreas; Le, Van Bang; Spinrad, Jeremy P.

Book ID: 124073531
Publisher: Society for Industrial and Applied Mathematics
Year: 1999
Weight: 175 KB
Category: Article
ISBN: 0898719798
DOI: 10.1137/1.9780898719796.ch14

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the strong perfect graph conjecture

✍ V Chvátal 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 144 KB

On the strong perfect graph conjecture

✍ Stephan Olariu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB

A graph G is perfect if for every induced subgraph H of G the chromatic number x(H) equals the largest number w ( H ) of pairwise adjacent vertices in H. Berge's famous Strong Perfect Graph Conjecture asserts that a graph G is perfect if and only if neither G nor its complement C contains an odd cho

The strong perfect graph conjecture for

The strong perfect graph conjecture for toroifal graphs

✍ Charles Grinstead 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 236 KB

The Strong Perfect Graph Conjecture for

The Strong Perfect Graph Conjecture for pan-free graphs

✍ Stephan Olariu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 345 KB

On the strong perfect graph conjecture a

On the strong perfect graph conjecture and critical graphs

✍ M.R. Sridharan; O.T. George 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 356 KB

Split-Neighborhood Graphs and the Strong

Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture

✍ F. Maffray; M. Preissmann 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 649 KB

We introduce the class of graphs such that every induced subgraph possesses a vertex whose neighbourhood can be split into a clique and a stable set. We prove that this class satisfies Berge's strong perfect graph conjecture. This class contains several well-known classes of (perfect) graphs and is