✦ LIBER ✦

On Tucker's proof of the strong perfect graph conjecture for (K4−e)-free graphs

✍ Scribed by Celina M.H. de Figueiredo; Sylvain Gravier; Cláudia Linhares Sales

Book ID: 108315579
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 69 KB
Volume: 232
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00352-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The validity of the strong perfect-graph

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

✍ K.R Parthasarathy; G Ravindra 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 205 KB

The Strong Perfect Graph Conjecture for

The Strong Perfect Graph Conjecture for pan-free graphs

✍ Stephan Olariu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 345 KB

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

MAGNA CARTAThe Great CharterPreamble

📂 Fiction 🌐 English ⚖ 11 KB 👁 18 views