Removing bottlenecks in the recognition of small $(k,\ell )$-graph classes

Flavia Bonomo-Braberman, Min Chih Lin, Ignacio Maqueda

A graph is a $(k,\ell )$-graph if its vertex set can be partitioned into $k$ independent sets and $\ell$ cliques. This family simultaneously generalizes split, bipartite, and co-bip…