𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture

✍ Scribed by F. Maffray; M. Preissmann

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
649 KB
Volume
63
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

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 polynomially recognizable. is: 1995 Acadernic Press. Inc

πŸ“œ 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

Even pairs and the strong perfect graph
Even pairs and the strong perfect graph conjecture
✍ Stefan Hougardy πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 130 KB

We will characterize all graphs that have the property that the graph and its complement are minimal even pair free. This characterization allows a new formulation of the Strong Perfect Graph Conjecture. The reader is assumed to be familiar with perfect graphs (see e.g. [2]). A hole is a cycle of l

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

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