The course emphasized algorithmic and structural aspects of "nice"
graph families, in particular perfect graphs, interval graphs, chordal
graphs and comparability graphs.
In Fall 92 the course was based to a large extent on the classic book of Martin C. Golumbic "Algorithmic Graph Theory and Perfect Graphs' (Academic Press, 1980), and in some parts also on the manuscript "The Art of Combinatorics", by Douglas B. West.
The Spring 94 and Spring 97 course had a similar basis, but emphasized more recent material, and made a lot of reference to applications in molecular biology. (See the webpage Algorithms for Molecular Biology for much more on these aspects.)
You can either download the complete notes as a single postscript file (150 pages), Or each lecture seperately.
For translations of the lecture notes to other languages see here.
Please send all feedback and comments to: email@example.com