Encyclopedia of Graphs

A cograph, or complement-reducible graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union. The following collection was calculated by Atila A. Jones (source) and lists all connected cographs on up to 15 vertices.

Only signed in users can post comments. Sign in here
Don't have an account yet? Register here