𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the sibling-structure of perfect graphs

✍ Scribed by C.T Hoàng

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
253 KB
Volume
49
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On theP4-Structure of Perfect Graphs V.
On theP4-Structure of Perfect Graphs V. Overlap Graphs
✍ Chı́nh T. Hoàng; Stefan Hougardy; Frédéric Maffray 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 480 KB

Given a graph G we define its k-overlap graph as the graph whose vertices are the induced P 4 's of G and two vertices in the overlap graph are adjacent if the corresponding P 4 's in G have exactly k vertices in common. For k=1, 2, 3 we prove that if the k-overlap graph of G is bipartite then G is

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