Minimal obstructions to $(s,1)$-polarity in cographs

F. Esteban Contreras-Mendoza, César Hernández-Cruz

Let $k,l$ be nonnegative integers. A graph $G$ is $(k,l)$-polar if its vertex set admits a partition $(A,B)$ such that $A$ induces a complete multipartite graph with at most $k$ pa…