𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The validity of the strong perfect-graph conjecture for (K4−e)-free graphs

✍ Scribed by K.R Parthasarathy; G Ravindra

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
205 KB
Volume
26
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Families of graphs complete for the stro
Families of graphs complete for the strong perfect graph Conjecture
✍ D. G. Corneil 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB 👁 1 views

The Strong Perfect Graph Conjecture states that a graph is perfect iff neither it nor its complement contains an odd chordless cycle of size greater than or equal to 5. In this article it is shown that many families of graphs are complete for this conjecture in the sense that the conjecture is true

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

Normal fraternally orientable graphs sat
Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
✍ H. Galeana-Sánchez 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 718 KB

The chromatic number x of a graph G is the minimum number of colors necessary to color the vertices of G such that no two adjacent vertices are colored alike. The clique number 01 of a graph G is the maximum number of vertices in a complete subgraph of G. A graph G is said to be perfect if x(H) =m(H