Cographs—complement-reducible graphs—can be viewed as intersection graphs (of -dimensional boxes), as intersections of graphs (of -free graphs), and as common tieset graphs of two-terminal graphs. This approach connects cographs with other topics such as chordal, interval, and series-parallel graphs, and it provides a natural dimension for cographs.
