Non Perfect Graphs - Graph Theory - Lecture Slides, Slides of Design Patterns

The key points discuss in the Graph theory, which I found very informative are: Non Perfect Graphs, Length, Odd Cycles, Complements, Berge'S Strong Perfect Graph, Conjecture, Perfect, Anti-Hole, Induced Hole, Thomas

Typology: Slides

2012/2013

Uploaded on 04/20/2013

sathyai
sathyai 🇮🇳

5

(5)

71 documents

1 / 6

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Graph Theory: Lecture No. 25
Can you think of some non-perfect graphs ?
Odd cycles of length at least 5. (Odd
holes)
Their complements. (Odd anti-holes.)
Docsity.com
pf3
pf4
pf5

Partial preview of the text

Download Non Perfect Graphs - Graph Theory - Lecture Slides and more Slides Design Patterns in PDF only on Docsity!

Can you think of some non-perfect graphs?

Odd cycles of length at least 5. (Odd holes) Their complements. (Odd anti-holes.)

Berge’s Strong Perfect Graph Conjecture (1964): A graph is perfect if and only if it has no induced hole or anti-hole.

A graph is perfect if and only if its complement is perfect

Any graph obtained from a perfect graph by expanding a vertex is again perfect