✦ LIBER ✦

On the Co- P 3 -Structure of Perfect Graphs

✍ Scribed by Hoàng, Chính T.; Reed, Bruce

Book ID: 118198865
Publisher: Society for Industrial and Applied Mathematics
Year: 2004
Tongue: English
Weight: 114 KB
Volume: 18
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480100370797

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the P4-structure of Perfect Graphs. I

On the P4-structure of Perfect Graphs. IV. Partner graphs

✍ Ryan B Hayward; William J Lenhart 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 318 KB

On the sibling-structure of perfect grap

On the sibling-structure of perfect graphs

✍ C.T Hoàng 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 253 KB

On the P4-structure of perfect graphs. I

On the P4-structure of perfect graphs. II. Odd decompositions

✍ C.T Hoang 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 897 KB

On the P4-structure of perfect graphs II

On the P4-structure of perfect graphs III. Partner decompositions

✍ V Chvátal 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 243 KB

On the P4-structure of perfect graphs I.

On the P4-structure of perfect graphs I. Even decompositions

✍ V Chvátal; C.T Hoang 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 795 KB

On theP4-Structure of Perfect Graphs V.

On theP4-Structure of Perfect Graphs V. Overlap Graphs

✍ Chı&#x0301;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