About Split, Comparability, Interval, and Permutation Graphs

Abstract

The last chapter of this book eventually presents some famous classes of perfect graphs, namely comparability, interval, permutation, and split graphs. We first present an example of a graph which is at the same time a triangulated, a comparability, a split, and a permutation graph. The importance to be an interval is illustrated with Berge’s mystery story. We discuss furthermore the generation of permutation graphs and close with how to recognise that a given graph is in fact a permutation graph.