𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A semi-strong Perfect Graph theorem

✍ Scribed by B Reed

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
1001 KB
Volume
43
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the strong perfect graph conjecture
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

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