Preface
Publisher Summary
The notion of a “perfect― graph was introduced by Claude Berge at the birth of the 1960s. Since that time, many classes of graphs, interesting in their own right, have been shown to be perfect. Research, in the meantime, has proceeded along two lines. The first line of investigation has included the proof of the perfect graph theorem, attempts at proving the strong perfect graph conjecture, studies of critically imperfect graphs, and other aspects of perfect graphs. The second line of approach has been to discover mathematical and algorithmic properties of special classes of perfect graphs: comparability graphs, triangulated graphs, and interval graphs, to name just a few. Many of these graphs arise ...
Get Algorithmic Graph Theory and Perfect Graphs, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
