Universality in the algebra and topology of cographs

Adityo Mamun, Jonathan Nalikka, Eric Ramos

A finite simple graph $G$ is called a cograph if it does not contain the path on four vertices $P_4$ as an induced subgraph. It is classically known that the family of cographs are…