The monopolar partition problem in restricted graph classes

A graph is called monopolar if its vertices can be partitioned into an independent set and a disjoint union of cliques. My undergraduate research with Jing Huang studied monopolar partitions in line graphs, claw-free graphs, and other graph classes.

Our results led to several papers:

I presented our results at various conferences and seminars. Here are my slides for a few of them: