Forschungsinstitut für Diskrete Mathematik
"Perfect graphs: Algorithmic and polyhedral aspects"
Perfect graphs were introduced in 1960 by Claude Berge and they form a
aspect of Graph Theory and of Combinatorial Optimization. We will review
some aspects of this class of graphs:
- Polytopes associated to perfect graphs, linear programming aspects
and the perfect graph conjecture.
- Algorithmic problems
- Special classes of perfect graphs: bipartite graphs, comparability
triangulated graphs, comparability graphs.
| Vorkenntnisse: || Diskrete Mathematik I.
| Ort: || Hörsaal Lennéstr. 2
| Zeit: || Mittwochs 16-18 Uhr
Prof. Dr. J. Fonlupt