A cograph is a graph containing no path on four vertices. Cographs or $P_4$-free graphs can be obtained from a single vertex by disjoint union and complementation operations.
Generators for cographs
Generators for cographs
A cograph is a graph containing no path on four vertices. Cographs or $P_4$-free graphs can be obtained from a single vertex by disjoint union and complementation operations.
<Unimplemented 'footnote' '.. [0] D.G. Corneil, H. Lerchs, L.Stewart Burlingham,\n "Complement reducible graphs",\n Discrete Applied Mathematics, Volume 3, Issue 3, 1981, Pages 163-174,\n ISSN 0166-218X.'>
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them