Preprint
Sep 2026
Universality in the algebra and topology of cographs
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 well-quasi-ordered by the induced subgraph relation \cite{D}. In preceding work of Knudsen and the third author \cite[Theorem 7.2]{KR}, it...
Adityo Mamun, Jonathan Nalikka, Eric Ramos
· 0 citations