Graph Theory: Lecture No. 23
Perfect Graphs: A graph Gis perfect if
χ(H) = ω(H)for every induced subgraph Hof
G.
Docsity.com
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community
Ask the community for help and clear up your study doubts
University Rankings
Discover the best universities in your country according to Docsity users
Free resources
Our save-the-student-ebooks!
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Perfect Graphs in Graph Theory: Characterization and Examples, Slides of Design Patterns
An introduction to perfect graphs in graph theory, defining the concept and listing some classes of graphs known to be perfect, including bipartite graphs, line graphs of bipartite graphs, comparability graphs, and chordal graphs. Perfect graphs are characterized by having the chromatic number equal to the clique number for every induced subgraph.
Typology: Slides
2012/2013
1 / 2
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download Perfect Graphs in Graph Theory: Characterization and Examples and more Slides Design Patterns in PDF only on Docsity!
Graph Theory: Lecture No. 23
Perfect Graphs: A graph G is perfect if
χ(H) = ω(H) for every induced subgraph H of
G.
Docsity.com
Graph Theory: Lecture No. 23
Some classes which are known to be perfect:
1 Bipartite Graphs
2 Complements of Bipartite Graphs
3 Line graphs of Bipartite Graphs.
4 Complements of Bipartite Graphs.
5 Comparability Graphs.
6 Co-comparability Graphs.
7 Interval Graphs
8 Co-Interval Graphs.
9 Chordal Graphs.
10 Co-Chordal Graphs. Docsity.com