Cographs—complement-reducible graphs—can be viewed as intersection graphs (of \(k\)-dimensional boxes), as intersections of graphs (of \(P_4 ,C_4\)-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.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.