Topic: Perfect Graphs and Special Colorings

Worked Examples of Perfect and Imperfect Graphs

Why Chordal Graphs Are Perfect

The Weak Perfect Graph Theorem

The Chordal Graph Characterization by Perfect Elimination

Simplicial Vertices and Elimination Orderings

Perfect Graphs and Induced-Subgraph Equalities

Maximum Cardinality Search for Chordal Recognition

List Coloring Chordal Graphs

List Coloring and List Chromatic Number

Kernel Orientations in Galvin’s Theorem