Foreword 2004: The annals edition
The world of perfect graphs has grown to include over 200 special graph classes. The Venn diagrams that are used to show some of the inclusions between classes in the First Generation—for example, Hasse diagrams for the Second Generation. Perhaps the most important new development in the theory of perfect graphs is the recent proof of the strong perfect graph conjecture by Chudnovsky, Robertson, Seymour, and Thomas announced in May 2002. On the algorithmic side, many of the problems that were open in 1980 have subsequently been settled, and algorithms on new classes of perfect graphs have been studied. For example, tolerance graphs generalize both interval ...
Get Algorithmic Graph Theory and Perfect Graphs, 2nd Edition now with O’Reilly online learning.
O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.