Minimal obstructions to $2$-polar cographs

Pavol Hell, César Hernández-Cruz, Cláudia Linhares Sales

A graph is a cograph if it is $P_4$-free. A $k$-polar partition of a graph $G$ is a partition of the set of vertices of $G$ into parts $A$ and $B$ such that the subgraph induced by…